{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:09:40Z","timestamp":1743152980535,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_13","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"179-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the\u00a0Smallest k-Enclosing Geodesic Disc in\u00a0a\u00a0Simple Polygon"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8906-0573","authenticated-orcid":false,"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Anthony","family":"D\u2019Angelo","sequence":"additional","affiliation":[]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. J. Algorithms 12(1), 38\u201356 (1991)","journal-title":"J. Algorithms"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, H., 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)","DOI":"10.1007\/s00454-016-9796-0"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1142\/S0218195914600097","volume":"24","author":"O Aichholzer","year":"2014","unstructured":"Aichholzer, O., Hackl, T., Korman, M., Pilz, A., Vogtenhuber, B.: Geodesic-preserving polygon simplification. Int. J. Comput. Geom. Appl. 24(4), 307\u2013324 (2014)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"13_CR4","unstructured":"Alexandrescu, A.: Fast deterministic selection. In: SEA. LIPIcs, vol. 75, pp. 24:1\u201324:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01553882","volume":"4","author":"B Aronov","year":"1989","unstructured":"Aronov, B.: On the geodesic Voronoi diagram of point sites in a simple polygon. Algorithmica 4(1), 109\u2013140 (1989)","journal-title":"Algorithmica"},{"key":"13_CR6","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.T.: The furthest-site geodesic Voronoi diagram. Discrete Comput. Geom. 9, 217\u2013255 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. In: Discrete Algorithms and Complexity, pp. 65\u201379. Elsevier (1987)","DOI":"10.1016\/B978-0-12-386870-1.50010-1"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2015.10.009","volume":"77","author":"SW Bae","year":"2019","unstructured":"Bae, S.W., Korman, M., Okamoto, Y.: Computing the geodesic centers of a polygonal domain. Comput. Geom. 77, 3\u20139 (2019)","journal-title":"Comput. Geom."},{"key":"13_CR9","unstructured":"Barba, L.: Optimal algorithm for geodesic farthest-point Voronoi diagrams. In: SoCG. LIPIcs, vol. 129, pp. 12:1\u201312:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"13_CR11","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1142\/S0218195911003822","volume":"21","author":"MG Borgelt","year":"2011","unstructured":"Borgelt, M.G., van Kreveld, M.J., Luo, J.: Geodesic disks and clustering in a simple polygon. Int. J. Comput. Geom. Appl. 21(6), 595\u2013608 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Bose, P., Toussaint, G.T.: Computing the constrained Euclidean geodesic and link center of a simple polygon with application. In: Computer Graphics International, pp. 102\u2013110. IEEE Computer Society (1996)","DOI":"10.1109\/CGI.1996.511792"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/PL00009478","volume":"22","author":"TM Chan","year":"1999","unstructured":"Chan, T.M.: Geometric applications of a randomized optimization technique. Discret. Comput. Geom. 22(4), 547\u2013567 (1999)","journal-title":"Discret. Comput. Geom."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: A theorem on polygon cutting with applications. In: FOCS, pp. 339\u2013349. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.58"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6(3), 485\u2013524 (1991). https:\/\/doi.org\/10.1007\/BF02574703","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"13_CR16","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B Chazelle","year":"1989","unstructured":"Chazelle, B., Guibas, L.J.: Visibility and intersection problems in plane geometry. Discrete Comput. Geom. 4(6), 551\u2013581 (1989). https:\/\/doi.org\/10.1007\/BF02187747","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1002\/net.3230130307","volume":"13","author":"O Chein","year":"1983","unstructured":"Chein, O., Steinberg, L.: Routing past unions of disjoint linear barriers. Networks 13(3), 389\u2013398 (1983)","journal-title":"Networks"},{"key":"13_CR18","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1006\/jagm.1995.1048","volume":"19","author":"A Datta","year":"1995","unstructured":"Datta, A., Lenhof, H., Schwarz, C., Smid, M.H.M.: Static and dynamic algorithms for k-point clustering problems. J. Algorithms 19(3), 474\u2013503 (1995)","journal-title":"J. Algorithms"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"de Berg, S., Staals, F.: Dynamic data structures for k-nearest neighbor queries. Comput. Geom. 111, 101976 (2023)","DOI":"10.1016\/j.comgeo.2022.101976"},{"issue":"1\/2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02915448","volume":"26","author":"L Devroye","year":"1988","unstructured":"Devroye, L.: Applications of the theory of records in the study of random trees. Acta Inform. 26(1\/2), 123\u2013130 (1988)","journal-title":"Acta Inform."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0925-7721(94)90003-5","volume":"4","author":"A Efrat","year":"1994","unstructured":"Efrat, A., Sharir, M., Ziv, A.: Computing the smallest k-enclosing circle and related problems. Comput. Geom. 4, 119\u2013136 (1994)","journal-title":"Comput. Geom."},{"issue":"3","key":"13_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom. 11(3), 321\u2013350 (1994). https:\/\/doi.org\/10.1007\/BF02574012","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"13_CR24","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":"13_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"LJ Guibas","year":"1987","unstructured":"Guibas, L.J., 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"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms, vol. 173. American Mathematical Society (2011)","DOI":"10.1090\/surv\/173"},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00453-004-1123-0","volume":"41","author":"S Har-Peled","year":"2005","unstructured":"Har-Peled, S., Mazumdar, S.: Fast algorithms for computing the smallest k-enclosing circle. Algorithmica 41(3), 147\u2013157 (2005)","journal-title":"Algorithmica"},{"key":"13_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0131-8","volume-title":"Lectures on Analysis on Metric Spaces","author":"J Heinonen","year":"2001","unstructured":"Heinonen, J.: Lectures on Analysis on Metric Spaces. Springer, New York (2001). https:\/\/doi.org\/10.1007\/978-1-4613-0131-8"},{"issue":"5","key":"13_CR29","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. Inf. Process. Lett. 38(5), 231\u2013235 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"13_CR30","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"13_CR31","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D Lee","year":"1984","unstructured":"Lee, D., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3), 393\u2013410 (1984)","journal-title":"Networks"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Liu, C., Lee, D.T.: Higher-order geodesic Voronoi diagrams in a polygonal domain with holes. In: SODA, pp. 1633\u20131645. SIAM (2013)","DOI":"10.1137\/1.9781611973105.117"},{"issue":"10","key":"13_CR33","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-P\u00e9rez","year":"1979","unstructured":"Lozano-P\u00e9rez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22(10), 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"issue":"4","key":"13_CR34","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(94)00190-A","volume":"53","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On enclosing k points by a circle. Inf. Process. Lett. 53(4), 217\u2013221 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"13_CR35","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On geometric optimization with few violated constraints. Discrete Comput. Geom. 14(4), 365\u2013384 (1995). https:\/\/doi.org\/10.1007\/BF02570713","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"13_CR36","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}}^{\\text{3 }}$$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Oh, E.: Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons. In: SODA, pp. 391\u2013409. SIAM (2019)","DOI":"10.1137\/1.9781611975482.25"},{"issue":"2","key":"13_CR38","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/s00454-019-00063-4","volume":"63","author":"E Oh","year":"2020","unstructured":"Oh, E., Ahn, H.: Voronoi diagrams for a moderate-sized point-set in a simple polygon. Discrete Comput. Geom. 63(2), 418\u2013454 (2020)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR39","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.comgeo.2019.05.001","volume":"82","author":"E Oh","year":"2019","unstructured":"Oh, E., Bae, S.W., Ahn, H.: Computing a geodesic two-center of points in a simple polygon. Comput. Geom. 82, 45\u201359 (2019)","journal-title":"Comput. Geom."},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Oh, E., De Carufel, J.L., Ahn, H.: The geodesic 2-center problem in a simple polygon. Comput. Geom. 74, 21\u201337 (2018)","DOI":"10.1016\/j.comgeo.2018.02.008"},{"issue":"6","key":"13_CR41","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). https:\/\/doi.org\/10.1007\/BF02187751","journal-title":"Discrete Comput. Geom."},{"key":"13_CR42","unstructured":"Rabanca, G., Vigan, I.: Covering the boundary of a simple polygon with geodesic unit disks. CoRR abs\/1407.0614 (2014)"},{"issue":"2","key":"13_CR43","first-page":"9","volume":"3","author":"G Toussaint","year":"1989","unstructured":"Toussaint, G.: Computing geodesic properties inside a simple polygon. Revue D\u2019Intell. Artif. 3(2), 9\u201342 (1989)","journal-title":"Revue D\u2019Intell. Artif."},{"key":"13_CR44","unstructured":"Vigan, I.: Packing and covering a polygon with geodesic disks. CoRR abs\/1311.6033 (2013)"},{"issue":"1","key":"13_CR45","first-page":"131","volume":"9","author":"H Wang","year":"2018","unstructured":"Wang, H.: On the geodesic centers of polygonal domains. JoCG 9(1), 131\u2013190 (2018)","journal-title":"JoCG"},{"key":"13_CR46","unstructured":"Wang, H.: An optimal deterministic algorithm for geodesic farthest-point voronoi diagrams in simple polygons. In: SoCG. LIPIcs, vol. 189, pp. 59:1\u201359:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"13_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359\u2013370. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0038202"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T05:02:55Z","timestamp":1729832575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}