The geodesic 2-center problem in a simple polygon
- 1 October 2018
- journal article
- research article
- Published by Elsevier in Computational Geometry
- Vol. 74, 21-37
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- MSIT (IITP–2017–0–00905)
- NRF (2011–0030044)
This publication has 13 references indexed in Scilit:
- A Linear-Time Algorithm for the Geodesic Center of a Simple PolygonDiscrete & Computational Geometry, 2016
- GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGONInternational Journal of Computational Geometry & Applications, 2011
- More planar two-center algorithmsComputational Geometry, 1999
- Data clusteringACM Computing Surveys, 1999
- The furthest-site geodesic voronoi diagramDiscrete & Computational Geometry, 1993
- The slab dividing approach to solve the EuclideanP-Center problemAlgorithmica, 1993
- Optimal shortest path queries in a simple polygonJournal of Computer and System Sciences, 1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983