A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
From MaRDI portal
Publication:1386341
DOI10.1007/PL00009199zbMath0895.68137MaRDI QIDQ1386341
Publication date: 20 September 1998
Published in: Algorithmica (Search for Journal in Brave)
Related Items
Short trees in polygons ⋮ Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons ⋮ SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS ⋮ Computing the \(L_1\) geodesic diameter and center of a polygonal domain ⋮ Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings ⋮ Voronoi diagrams for a moderate-sized point-set in a simple polygon ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon ⋮ Computing a geodesic two-center of points in a simple polygon ⋮ GEODESIC-PRESERVING POLYGON SIMPLIFICATION
