Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
From MaRDI portal
Publication:6102304
DOI10.1007/3-540-60313-1_147zbMath1512.68421MaRDI QIDQ6102304
Der-Tsai Lee, Evanthia Papadopoulou
Publication date: 8 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Generalized Delaunay triangulation for planar graphs
- A sweepline algorithm for Voronoi diagrams
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Constrained Delaunay triangulations
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Euclidean shortest paths in the presence of rectilinear barriers
- Optimal Search in Planar Subdivisions