A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
From MaRDI portal
Publication:1386341
Recommendations
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- On the geodesic Voronoi diagram of point sites in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
Cited in
(15)- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Geodesic-preserving polygon simplification
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Short trees in polygons
- Computing the cut locus, Voronoi diagram, and signed distance function of polygons
- Constructing the internal Voronoi diagram of polygonal figure using the sweepline method
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain
This page was built for publication: A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386341)
