Voronoi diagrams for a moderate-sized point-set in a simple polygon
From MaRDI portal
Publication:2291454
Recommendations
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- scientific article; zbMATH DE number 4051001
- scientific article; zbMATH DE number 1424293
- ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
- scientific article; zbMATH DE number 219275
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Voronoi diagrams for polygon-offset distance functions
- The geodesic farthest-point Voronoi diagram in a simple polygon
Cites work
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- A linear-time algorithm for the geodesic center of 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
- A sweepline algorithm for Voronoi diagrams
- Computing the geodesic center of a simple polygon
- Decomposable searching problems I. Static-to-dynamic transformation
- Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Optimal shortest path queries in a simple polygon
- Ray shooting in polygons using geodesic triangulations
- The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
- The furthest-site geodesic Voronoi diagram
Cited in
(23)- Voronoi diagrams for polygon-offset distance functions
- The Hausdorff Voronoi diagram of point clusters in the plane
- Piercing pairwise intersecting geodesic disks
- The furthest-site geodesic Voronoi diagram
- scientific article; zbMATH DE number 4051001 (Why is no real title available?)
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
- Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
- Computational Science and Its Applications – ICCSA 2004
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Voronoi diagram for convex polygonal sites with convex polygon-offset distance function
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Dynamic data structures for \(k\)-nearest neighbor queries
- Voronoi diagrams for convex polygon-offset distance functions
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles
- Link distance and shortest path problems in the plane
- The geodesic farthest-point Voronoi diagram in a simple polygon
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
This page was built for publication: Voronoi diagrams for a moderate-sized point-set in a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291454)
