{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:29Z","timestamp":1742617169787,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603139"},{"type":"electronic","value":"9783540449133"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60313-1_147","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:16:13Z","timestamp":1330280173000},"page":"238-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient computation of the geodesic Voronoi diagram of points in a simple polygon"],"prefix":"10.1007","author":[{"given":"Evanthia","family":"Papadopoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01553882","volume":"4","author":"B. Aronov","year":"1989","unstructured":"B. Aronov. \u201cOn the geodesic Voronoi diagram of point sites in a simple polygon\u201d, Algorithmica, 4 (1989), 109\u2013140.","journal-title":"Algorithmica"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"F. Aurenhammer, \u201cVoronoi diagrams: A survey of a fundamental geometric data structure,\u201d ACM Comput. Survey, 23 1991, 345\u2013405.","journal-title":"ACM Comput. Survey"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Ta. Asano and Te. Asano, \u201cVoronoi diagrams for points in a polygon,\u201d in Discrete Algorithms & Complexity: Perspective in Computing, ed. D. S.Johnson, Academic Press, 1987, 51\u201364.","DOI":"10.1016\/B978-0-12-386870-1.50009-5"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"L. P. Chew","year":"1989","unstructured":"L. P. Chew, Constrained Delaunay triangulations, Algorithmica, 4 (1989), 97\u2013108.","journal-title":"Algorithmica"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica, 2 (1987), 153\u2013174.","journal-title":"Algorithmica"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. J. Guibas","year":"1987","unstructured":"L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R.E. Tarjan, \u201cLinear-time algorithms for visibility and shortest path problems inside triangulated simple polygons\u201d, Algorithmica, 2 (1987), 209\u2013233.","journal-title":"Algorithmica"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"L. J. Guibas and R. Sedgewick, \u201cA dichromatic framework for balanced trees\u201d, Proc. 19th IEEE Symp. on Foundations of Computer Science, 1978, 8\u201321.","DOI":"10.1109\/SFCS.1978.3"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"J. Hershberger and S. Suri, \u201cEfficient Computation of Euclidean Shortest Paths in the Plane\u201d, 34th Symp. on Foundations of Computer Science, 1993, 508\u2013517.","DOI":"10.1109\/SFCS.1993.366836"},{"issue":"No1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"D. Kirkpatrick, \u201cOptimal Search in Planar Subdivisions\u201d SIAM J. Computing, Vol. 12, No 1, 1983, 28\u201335.","journal-title":"SIAM J. Computing"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","volume":"1","author":"D. T. Lee","year":"1986","unstructured":"D. T. Lee and A. K. Lin, \u201cGeneralized Delaunay triangulations for planar graphs\u201d, Discrete Computational Geometry, 1 (1986),201\u2013217.","journal-title":"Discrete Computational Geometry"},{"key":"18_CR11","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, \u201cEuclidean Shortest Paths in the Presence of Rectilinear Barriers\u201d, Networks, 14 1984, 393\u2013410.","journal-title":"Networks"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"J. S. B. Mitchell, \u201cShortest paths among obstacles in the plane\u201d, Proc. 9th ACM Symp. on Comput. Geometry, May 1993, 308\u2013317.","DOI":"10.1145\/160985.161156"},{"key":"18_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F. P. and M. I. Shamos, Computational Geometry: an Introduction, Springer-Verlag, New York, NY 1985."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"C. Wang and L. Schubert, \u201cAn optimal algorithm for constructing the Delaunay triangulation of a set of line segments\u201d, Proc. 3rd ACM Symposium on Computational Geometry, 1987, 223\u2013232.","DOI":"10.1145\/41958.41982"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '95"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60313-1_147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:59:44Z","timestamp":1742597984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60313-1_147"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603139","9783540449133"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60313-1_147","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}