Finding constrained and weighted Voronoi diagrams in the plane
From MaRDI portal
Publication:1388136
DOI10.1016/S0925-7721(97)00028-XzbMath0896.68145OpenAlexW2026976813MaRDI QIDQ1388136
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
Related Items (3)
A note on visibility-constrained Voronoi diagrams ⋮ Algorithms for computing best coverage path in the presence of obstacles in a sensor field ⋮ Voronoi diagram with visual restriction
Cites Work
- Unnamed Item
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Constrained Delaunay triangulations
- Voronoi diagrams with barriers and the shortest diagonal problem
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
This page was built for publication: Finding constrained and weighted Voronoi diagrams in the plane