Finding constrained and weighted Voronoi diagrams in the plane
From MaRDI portal
Publication:1388136
DOI10.1016/S0925-7721(97)00028-XzbMath0896.68145MaRDI QIDQ1388136
Publication date: 8 June 1998
Published in: Computational Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
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