{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:13:05Z","timestamp":1764364385464,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["IITP-2017-0-00905"],"award-info":[{"award-number":["IITP-2017-0-00905"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00454-019-00063-4","type":"journal-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T10:21:53Z","timestamp":1551435713000},"page":"418-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon"],"prefix":"10.1007","volume":"63","author":[{"given":"Eunjin","family":"Oh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-1679","authenticated-orcid":false,"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,1]]},"reference":[{"issue":"4","key":"63_CR1","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/s00454-016-9796-0","volume":"56","author":"H-K Ahn","year":"2016","unstructured":"Ahn, H.-K., Barba, L., Bose, P., De Carufel, J.-L., Korman, M., Oh, E.: A linear-time algorithm for the geodesic center of a simple polygon. Discrete Comput. Geom. 56(4), 836\u2013859 (2016)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"63_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01553882","volume":"4","author":"B Aronov","year":"1989","unstructured":"Aronov, B.: On the geodesic Vorono\u012d diagram of point sites in a simple polygon. Algorithmica 4(1), 109\u2013140 (1989)","journal-title":"Algorithmica"},{"issue":"1","key":"63_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02189321","volume":"9","author":"B Aronov","year":"1993","unstructured":"Aronov, B., Fortune, S., Wilfong, G.: The furthest-site geodesic Vorono\u012d diagram. Discrete Comput. Geom. 9(1), 217\u2013255 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"63_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"JL Bentley","year":"1980","unstructured":"Bentley, J.L., Saxe, J.B.: Decomposable searching problems I: static-to-dynamic transformations. J. Algorithms 1(4), 297\u2013396 (1980)","journal-title":"J. Algorithms"},{"key":"63_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method","author":"B Chazelle","year":"2000","unstructured":"Chazelle, B.: The Discrepancy Method. Cambridge University Press, Cambridge (2000)"},{"issue":"1","key":"63_CR6","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF01377183","volume":"12","author":"B Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., Snoeyink, J.: Ray shooting in polygons using geodesic triangulations. Algorithmica 12(1), 54\u201368 (1994)","journal-title":"Algorithmica"},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Vorono\u012d diagrams. Algorithmica 2, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"issue":"2","key":"63_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"LJ Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. 39(2), 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"63_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"5","key":"63_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(91)90064-O","volume":"38","author":"J Hershberger","year":"1991","unstructured":"Hershberger, J.: A new data structure for shortest path queries in a simple polygon. Inform. Process. Lett. 38(5), 231\u2013235 (1991)","journal-title":"Inform. Process. Lett."},{"key":"63_CR11","doi-asserted-by":"crossref","unstructured":"Liu, C.-H., Lee, D.T.: Higher-order geodesic Voronoi diagrams in a polygonal domain with holes. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 1633\u20131645. SIAM, Philadelphia (2013)","DOI":"10.1137\/1.9781611973105.117"},{"issue":"4","key":"63_CR12","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in ${{\\mathbb{R}}}^3$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"63_CR13","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"JSB Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. North-Holland, Amsterdam (2000)"},{"key":"63_CR14","unstructured":"Oh, E., Barba, L, Ahn, H.-K.: The farthest-point geodesic voronoi diagram of points on the boundary of a simple polygon. In: Fekete, S., Lubiw, A. (eds.) Proceedings of the 32nd International Symposium on Computational Geometry (SoCG 2016). LIPIcs. Leibniz International Proceedings in Informatics, vol. 51, pp. 56:1\u201356:15. Schloss Dagstuhl. Leibniz-Zentrum f\u00fcr Informatik, Wadern (2016)"},{"issue":"4","key":"63_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/PL00009199","volume":"20","author":"E Papadopoulou","year":"1998","unstructured":"Papadopoulou, E., Lee, D.T.: A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains. Algorithmica 20(4), 319\u2013352 (1998)","journal-title":"Algorithmica"},{"issue":"6","key":"63_CR16","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/BF02187751","volume":"4","author":"R Pollack","year":"1989","unstructured":"Pollack, R., Sharir, M., Rote, G.: Computing the geodesic center of a simple polygon. Discrete Comput. Geom. 4(6), 611\u2013626 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"63_CR17","doi-asserted-by":"crossref","unstructured":"Zavershynskyi, M., Papadopoulou, E.: A sweepline algorithm for higher order voronoi diagrams. In: Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013), pp. 16\u201322. IEEE (2013)","DOI":"10.1109\/ISVD.2013.17"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00063-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-019-00063-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00063-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T19:16:59Z","timestamp":1582917419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-019-00063-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,1]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["63"],"URL":"https:\/\/doi.org\/10.1007\/s00454-019-00063-4","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2019,3,1]]},"assertion":[{"value":"7 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}