{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T13:04:44Z","timestamp":1698325484102},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1007\/bf02247961","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T04:31:48Z","timestamp":1132029108000},"page":"1-19","source":"Crossref","is-referenced-by-count":2,"title":["Computing the external geodesic diameter of a simple polygon"],"prefix":"10.1007","volume":"44","author":[{"given":"D.","family":"Samuel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. T.","family":"Toussaint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02247961_CR1","doi-asserted-by":"crossref","unstructured":"T. Asano, L. Guibas, J. Hershberger, and H. Imai. Visibility-Polygon Search and Euclidean Shortest Paths. Proc. of 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 155\u2013164.","DOI":"10.1109\/SFCS.1985.65"},{"key":"BF02247961_CR2","doi-asserted-by":"crossref","unstructured":"T. Asano and G. Toussaint. Computing the Geodesic Center of a Simple Polygon. Discrete Algorithms and Complexity, Proc. of the Japan-U.S. Joint Seminar, June 4\u20136, 1986, Kyoto, Japan, pp. 65\u201379.","DOI":"10.1016\/B978-0-12-386870-1.50010-1"},{"key":"BF02247961_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle. A Theorem on Polygon Cutting with Applications. Proc. of 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp. 339\u2013349.","DOI":"10.1109\/SFCS.1982.58"},{"key":"BF02247961_CR4","doi-asserted-by":"crossref","first-page":"684","DOI":"10.2307\/2373068","volume":"87","author":"H. Davenport","year":"1965","unstructured":"H. Davenport and A. Schinzel. A Combinatorial Problem Connected with Differential Equations. Amer. J. Math.,87, 1965, pp. 684\u2013694.","journal-title":"Amer. J. Math."},{"key":"BF02247961_CR5","doi-asserted-by":"crossref","unstructured":"L. Guibas and J. Hershberger. Optimal Shortest Path Queries in a Simple Polygon. Proc. of the Third Ann. Symp. on Comp. Geom., 1987, pp. 64\u201375.","DOI":"10.1145\/41958.41964"},{"key":"BF02247961_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. Algorithmica,2, 1987, pp. 175\u2013193.","journal-title":"Algorithmica"},{"key":"BF02247961_CR7","doi-asserted-by":"crossref","unstructured":"L. Guibas, E. McCreight, M. Plass, and J. Roberts. A New Representation for Linear Lists. Proc. 9th ACM Symp. on Theory of Computing, 1977, pp. 49\u201360.","DOI":"10.1145\/800105.803395"},{"key":"BF02247961_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00288968","volume":"17","author":"S. Huddleston","year":"1982","unstructured":"S. Huddleston and K. Mehlhorn. A New Data Structure for Representing Sorted Lists. Acta Informatica,17, 1982, pp. 157\u2013184.","journal-title":"Acta Informatica"},{"key":"BF02247961_CR9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"d. Kirkpatrick","year":"1983","unstructured":"d. Kirkpatrick. Optimal Search in Planar Subdivisions. SIAM J. Computing,12, 1983, pp. 28\u201335.","journal-title":"SIAM J. Computing"},{"issue":"3","key":"BF02247961_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. Euclidean Shortest Paths in the Presence of Rectilinear Barriers. Networks, vol. 14, 3, 1984, pp. 393\u2013410.","journal-title":"Networks"},{"key":"BF02247961_CR11","doi-asserted-by":"crossref","unstructured":"D. Mount. On Finding Shortest Paths on Convex Polyhedra. Tech. Rept., University of Maryland, May 1985.","DOI":"10.21236\/ADA166246"},{"key":"BF02247961_CR12","unstructured":"R. Pollack, G. Rote and M. Sharir. Computing the Geodesic Center of a Simple Polygon. Tech. Rept. 231, Computer Science Department, Courant Institute, July 1986."},{"key":"BF02247961_CR13","unstructured":"R. Pollack and M. Sharir. Computing the Geodesic Center of a Simple Polygon in \u201cResearch Workshop on Moveable Separability of Sets,\u201d G. Toussaint, ed., Bellairs Research Institute of McGill University, February 1986, pp. 26\u201347."},{"key":"BF02247961_CR14","unstructured":"J. Reif and J. Storer. Shortest Paths in Euclidean Space with Polyhedral Obstacles. Tech. Rept., Brandeis University, April 1985."},{"key":"BF02247961_CR15","unstructured":"J. Reif and J. Storer. Minimizing Turns for Discrete Movement in the Interior of a Polygon. Tech. Rept., Harvard University, December 1985."},{"key":"BF02247961_CR16","unstructured":"M. I. Shamos. Problems in Computational Geometry. PhD thesis, Carnegie-Mellon University, 1977."},{"key":"BF02247961_CR17","doi-asserted-by":"crossref","unstructured":"M. Sharir and A. Schorr. On Shortest Paths in Polyhedral Spaces. Proc. 16th ACM Symp. on Theory of Computing, 1984, pp. 144\u2013153.","DOI":"10.1145\/800057.808676"},{"key":"BF02247961_CR18","doi-asserted-by":"crossref","unstructured":"S. Suri. The All-Geodesic-Furthest Neighbours Problem for Simple Polygons. Proc. of the Third Ann. Symp. on Comp. Geom., 1987, pp. 64\u201375.","DOI":"10.1145\/41958.41965"},{"key":"BF02247961_CR19","doi-asserted-by":"crossref","first-page":"213","DOI":"10.4064\/aa-25-2-213-224","volume":"25","author":"E. Szemeredi","year":"1974","unstructured":"E. Szemeredi. On a Problem by Davenport and Schinzel. Acta Arith.,25, 1974, pp. 213\u2013224.","journal-title":"Acta Arith."},{"key":"BF02247961_CR20","first-page":"9","volume":"3","author":"G. Toussaint","year":"1989","unstructured":"G. Toussaint. Computing Geodesic Properties Inside a Simple Polygon. Revue d'Intelligence Artificielle, 3, 1989, pp. 9\u201342.","journal-title":"Revue d'Intelligence Artificielle"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247961.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02247961\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02247961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T22:22:15Z","timestamp":1586557335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02247961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF02247961"],"URL":"https:\/\/doi.org\/10.1007\/bf02247961","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}