scientific article; zbMATH DE number 4051001
From MaRDI portal
Publication:3787490
Recommendations
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- On the geodesic Voronoi diagram of point sites in a simple polygon
Cited in
(17)- Rounding Voronoi diagram
- An equivalence diagram of star partitioning and simple polygons generation
- On the geodesic Voronoi diagram of point sites in a simple polygon
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- scientific article; zbMATH DE number 2036224 (Why is no real title available?)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Aspect-ratio Voronoi diagram and its complexity bounds
- Representing the Voronoï diagram of a simple polygon using rational quadratic Bézier curves
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
- Constructing the internal Voronoi diagram of polygonal figure using the sweepline method
- A straightforward iterative algorithm for the planar Voronoi diagram
- Recognizing Voronoi Diagrams with Linear Programming
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
- Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
- scientific article; zbMATH DE number 177538 (Why is no real title available?)
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787490)
