Higher-order Voronoi diagrams on triangulated surfaces
From MaRDI portal
Publication:987784
DOI10.1016/j.ipl.2009.01.001zbMath1209.68581MaRDI QIDQ987784
J. Antoni Sellarès, Marta Fort, Sergio Cabello
Publication date: 16 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.001
Voronoi diagram; computational geometry; combinatorial complexity; triangulated surface; triangulated terrain
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Computing generalized higher-order Voronoi diagrams on triangulated surfaces, A distance function for computing on finite subsets of Euclidean spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facility location on a polyhedral surface
- Applications of random sampling in computational geometry. II
- The Discrete Geodesic Problem
- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- The Clarkson–Shor Technique Revisited and Extended