Finding constrained and weighted Voronoi diagrams in the plane
From MaRDI portal
(Redirected from Publication:1388136)
Recommendations
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- A note on visibility-constrained Voronoi diagrams
- Duality of constrained Voronoi diagrams and Delaunay triangulations
- Order-k Voronoi diagrams of sites with additive weights in the plane
- Weighted Voronoi diagrams in the maximum norm
Cites work
- scientific article; zbMATH DE number 4060713 (Why is no real title available?)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Constrained Delaunay triangulations
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- Voronoi diagrams with barriers and the shortest diagonal problem
Cited in
(8)- A note on visibility-constrained Voronoi diagrams
- Voronoi diagram with visual restriction
- Duality of constrained Voronoi diagrams and Delaunay triangulations
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field
- Voronoi diagram with visual restriction
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Capacity-constrained Voronoi diagrams in finite spaces
- Weighted Voronoi diagrams in the maximum norm
This page was built for publication: Finding constrained and weighted Voronoi diagrams in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388136)