Computing the geodesic centers of a polygonal domain
Authors:
- Sang Won BaeSBSang Won Bae
- Matias KormanMKMatias Korman
- Yoshio OkamotoYOYoshio Okamoto
- 1 March 2019
- journal article
- conference paper
- Published by Elsevier in Computational Geometry
- Vol. 77, 3-9
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Research Foundation of Korea (2013R1A1A1A05006927)
- Ministry of Education, Culture, Sports, Science and Technology (24106008)
- Ministry of Education and Science
- Japan Society for the Promotion of Science
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 8 references indexed in Scilit:
- The Geodesic Diameter of Polygonal DomainsDiscrete & Computational Geometry, 2013
- An Optimal Algorithm for Euclidean Shortest Paths in the PlaneSIAM Journal on Computing, 1999
- Matrix Searching with the Shortest-Path MetricSIAM Journal on Computing, 1997
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANEInternational Journal of Computational Geometry & Applications, 1996
- Almost tight upper bounds for lower envelopes in higher dimensionsDiscrete & Computational Geometry, 1994
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrainsDiscrete & Computational Geometry, 1994
- Computing the geodesic center of a simple polygonDiscrete & Computational Geometry, 1989
- Computing geodesic furthest neighbors in simple polygonsJournal of Computer and System Sciences, 1989