Finding constrained and weighted Voronoi diagrams in the plane
From MaRDI portal
Publication:1388136
DOI10.1016/S0925-7721(97)00028-XzbMATH Open0896.68145OpenAlexW2026976813MaRDI QIDQ1388136FDOQ1388136
Authors: Cao An Wang, Yung H. Tsin
Publication date: 8 June 1998
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00028-x
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
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Constrained Delaunay triangulations
- Voronoi diagrams with barriers and the shortest diagonal problem
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Title not available (Why is that?)
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
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)