An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
From MaRDI portal
Cites work
- A linear-time algorithm for the geodesic center of a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- A new data structure for shortest path queries in a simple polygon
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Computing geodesic furthest neighbors in simple polygons
- Computing the geodesic center of a simple polygon
- Computing the geodesic centers of a polygonal domain
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 741008 (Why is no real title available?)
- scientific article; zbMATH DE number 7030514 (Why is no real title available?)
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- scientific article; zbMATH DE number 7559212 (Why is no real title available?)
- Matrix Searching with the Shortest-Path Metric
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
- Optimal shortest path queries in a simple polygon
- Ray shooting in polygons using geodesic triangulations
- The furthest-site geodesic Voronoi diagram
- The geodesic diameter of polygonal domains
- The geodesic farthest-point Voronoi diagram in a simple polygon
- The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
This page was built for publication: An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234117)
