Beating the spread

DOI10.1145/1998196.1998252zbMath1283.68372OpenAlexW1989566182MaRDI QIDQ5404446

Donald R. Sheehy, Todd Phillips, Gary Lee Miller

Publication date: 24 March 2014

Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1998196.1998252

zbMATH Keywords

mesh generationspreadepsilon netsrange spacessparse Voronoi refinement

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Approximating Nearest Neighbor Distances ⋮ A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations ⋮ Complex Root Finding Algorithm Based on Delaunay Triangulation

This page was built for publication: Beating the spread