A fast algorithm for well-spaced points and approximate delaunay graphs
From MaRDI portal
Publication:5174489
DOI10.1145/2462356.2462404zbMath1305.68341arXiv1304.0524MaRDI QIDQ5174489
Ameya Velingker, Donald R. Sheehy, Gary Lee Miller
Publication date: 17 February 2015
Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.0524
mesh generation; Voronoi diagrams; Delaunay refinement; output sensitive algorithms; Voronoi refinement
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
68W25: Approximation algorithms
Related Items
A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations, Approximating Nearest Neighbor Distances
Uses Software