$$L_1$$ Geodesic Farthest Neighbors in a Simple Polygon and Related Problems-Reference-Cited by-同舟云学术

$$L_1$$ Geodesic Farthest Neighbors in a Simple Polygon and Related Problems

Published:2019-06-17 Issue:4 Volume:62 Page:743-774
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Bae Sang Won^ORCID

Funder

National Research Foundation of Korea

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-019-00110-0.pdf

Reference16 articles.

1. 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–859 (2016)

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

3. Bae, S.W., Korman, M., Okamoto, Y., Wang, H.: Computing the $L_1$ geodesic diameter and center of a simple polygon in linear time. Comput. Geom. 48(6), 495–505 (2015)

4. Barba, L.: Optimal algorithm for geodesic farthest-point Voronoi diagrams. In: Proceedings of the 35th Symposium on Computational Geometry (SoCG 2019). LIPIcs (2019)

5. Chan, T.M.: More planar two-center algorithms. Comput. Geom. 13(3), 189–198 (1999)

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

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

2. Covering Convex Polygons by Two Congruent Disks;Lecture Notes in Computer Science;2021