A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon-Reference-Cited by-同舟云学术

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon

Published:2016-07-11 Issue:4 Volume:56 Page:836-859
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Ahn Hee-Kap,Barba Luis,Bose Prosenjit,De Carufel Jean-Lou,Korman Matias,Oh Eunjin

Funder

National Research Foundation of Korea (KR)

National Institutes of Natural Sciences (JP)

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-016-9796-0.pdf

Reference28 articles.

1. Aronov, B.: On the geodesic Voronoi diagram of point sites in a simple polygon. Algorithmica 4(1–4), 109–140 (1989)

2. Aronov, B., Fortune, S., Wilfong, G.: The furthest-site geodesic Voronoi diagram. Discrete Comput. Geom. 9(1), 217–255 (1993)

3. Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. Technical Report SOCS-85.32, McGill University (1985)

4. Bae, S.W., Korman, M., Mitchell, J.S.B., Okamoto, Y., Polishchuk, V., Wang, H.: Computing the L1 geodesic diameter and center of a polygonal domain. In: Ollinger, N., Vollmer, H. (eds) 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 47, pp. 14:1–14:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2016). ISBN 978-3-95977-001-9

5. Bae, S.W., Korman, M., Okamoto, Y.: The geodesic diameter of polygonal domains. Discrete Comput. Geom. 50(2), 306–329 (2013)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Covering convex polygons by two congruent disks;Computational Geometry;2023-02

2. Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon;Lecture Notes in Computer Science;2023

3. Maximal Distortion of Geodesic Diameters in Polygonal Domains;Lecture Notes in Computer Science;2023

4. An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons;Discrete & Computational Geometry;2022-08-30

5. The Polygon Burning Problem;WALCOM: Algorithms and Computation;2022