Computing planar Voronoi diagrams in double precision
From MaRDI portal
Publication:5405905
DOI10.1145/1810959.1811024zbMath1284.68611OpenAlexW2078256008WikidataQ56970213 ScholiaQ56970213MaRDI QIDQ5405905
David L. Millman, Jack Scott Snoeyink
Publication date: 3 April 2014
Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1810959.1811024
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations, A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
