Computing a geodesic two-center of points in a simple polygon
From MaRDI portal
Publication:2331214
DOI10.1016/j.comgeo.2019.05.001zbMath1468.68269arXiv1910.12177OpenAlexW2943988667WikidataQ127889797 ScholiaQ127889797MaRDI QIDQ2331214
Sang Won Bae, Hee-Kap Ahn, Eunjin Oh
Publication date: 25 October 2019
Published in: Computational Geometry, LATIN 2016: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.12177
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon, Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon, Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon, Unnamed Item, \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
Cites Work
- Computing the geodesic center of a simple polygon
- A linear-time algorithm for the geodesic center of a simple polygon
- A new data structure for shortest path queries in a simple polygon
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- The furthest-site geodesic Voronoi diagram
- Ray shooting in polygons using geodesic triangulations
- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- Optimal shortest path queries in a simple polygon
- More planar two-center algorithms
- The 2-Center Problem with Obstacles
- The 2-Center Problem in a Simple Polygon
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Parallel Merge Sort
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Slowing down sorting networks to obtain faster sorting algorithms
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
