{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T10:14:50Z","timestamp":1775643290319,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1988,9]]},"DOI":"10.1007\/bf02187913","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T04:11:50Z","timestamp":1130559110000},"page":"281-293","source":"Crossref","is-referenced-by-count":32,"title":["Computing the link center of a simple polygon"],"prefix":"10.1007","volume":"3","author":[{"given":"W.","family":"Lenhart","sequence":"first","affiliation":[]},{"given":"R.","family":"Pollack","sequence":"additional","affiliation":[]},{"given":"J.","family":"Sack","sequence":"additional","affiliation":[]},{"given":"R.","family":"Seidel","sequence":"additional","affiliation":[]},{"given":"M.","family":"Sharir","sequence":"additional","affiliation":[]},{"given":"S.","family":"Suri","sequence":"additional","affiliation":[]},{"given":"G.","family":"Toussaint","sequence":"additional","affiliation":[]},{"given":"S.","family":"Whitesides","sequence":"additional","affiliation":[]},{"given":"C.","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1988,9,1]]},"reference":[{"key":"BF02187913_CR1","unstructured":"A. Asano and G. T. Toussaint (1985). Computing the geodesic center of a simple polygon, Tech. Report SOCS-85.32, McGill University; see alsoProc. US-Japan Seminar on Computer Science, Japan, June 1986."},{"key":"BF02187913_CR2","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"30","author":"D. Avis","year":"1981","unstructured":"D. Avis and G. T. Toussaint (1981). An optimal algorithm for determining the visibility of a polygon from an edge,IEEE Trans. Comput. 30 pp. 910\u2013914.","journal-title":"IEEE Trans. Comput."},{"key":"BF02187913_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle (1982). A theorem on polygon cutting with applications,Proc. 23rd IEEE Symposium on Foundations of Computer Science, pp. 339\u2013349.","DOI":"10.1109\/SFCS.1982.58"},{"key":"BF02187913_CR4","unstructured":"B. Chazelle and L. Guibas (1985). Visibility and intersection problems in plane geometry,Proc. ACM Symposium on Computational Geometry, pp. 135\u2013146."},{"key":"BF02187913_CR5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"H. Gindy El","year":"1981","unstructured":"H. El Gindy and D. Avis (1981). A linear algorithm for computing the visibility polygon from a point,J. Algorithms 2 pp. 186\u2013197.","journal-title":"J. Algorithms"},{"key":"BF02187913_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M. R. Garey","year":"1978","unstructured":"M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan (1978). Triangulating a simple polygon,Inform. Process. Lett. 7 pp. 175\u2013180.","journal-title":"Inform. Process. Lett."},{"key":"BF02187913_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic (1980).Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York."},{"key":"BF02187913_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan (1987). Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons,Algorithmica 2 pp. 209\u2013233.","journal-title":"Algorithmica"},{"key":"BF02187913_CR9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01696777","volume":"37","author":"E. Helly","year":"1930","unstructured":"E. Helly (1930). \u00dcber Systeme abgeschlossener Mengen mit gemeinschaftlichen Punkten,Monatsh. Math. Phys. 37 pp. 281\u2013302.","journal-title":"Monatsh. Math. Phys."},{"issue":"3","key":"BF02187913_CR10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. T. Lee","year":"1984","unstructured":"D. T. Lee and F. P. Preparata (1984). Euclidean shortest paths in the presence of reculinear barriers,Networks 14(3) pp. 393\u2013410.","journal-title":"Networks"},{"key":"BF02187913_CR11","first-page":"108","volume":"8","author":"J. Moln\u00e1r","year":"1957","unstructured":"J. Moln\u00e1r (1957). \u00dcber den zweidimensionalen topologischen Satz von Helly,Mat. Lapok 8 pp. 108\u2013114. (Hungarian with German and Russian summaries.)","journal-title":"Mat. Lapok"},{"key":"BF02187913_CR12","unstructured":"R. Pollack, G. Rote, and M. Sharir (1986). Computing the geodesic center of a simple polygon, Tech. Report 231, Comp. Sci. Dept., Courant Institute, July 1986 (to appear inDiscrete and Computational Geometry)."},{"key":"BF02187913_CR13","unstructured":"S. Suri (1987). Minimum link paths in polygons and related problems, Ph.D. thesis, Dept. of Comp. Science, Johns Hopkins University, August 1987."},{"key":"BF02187913_CR14","unstructured":"S. Suri (1987). Computing all geodesic furthest neighbors of a simple polygon,Proc. 3rd ACM Conference on Computational Geometry, pp. 64\u201375."},{"key":"BF02187913_CR15","unstructured":"R. E. Tarjan and C. J. Van Wyk (1986). AnO(n log logn)-time algorithm for triangulating simple polygons, preprint (submitted toSIAM J. Comput.)."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187913.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187913\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T13:22:36Z","timestamp":1557840156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["BF02187913"],"URL":"https:\/\/doi.org\/10.1007\/bf02187913","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}