ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
From MaRDI portal
Publication:4848836
DOI10.1142/S0218195995000192zbMath0835.68121MaRDI QIDQ4848836
Hristo N. Djidjev, Andrzej Lingas
Publication date: 16 April 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195995000192
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Computing hereditary convex structures, Preprocessing imprecise points for Delaunay triangulation: simplified and extended, A nearly parallel algorithm for the Voronoi diagram of a convex polygon, Time-space trade-offs for triangulations and Voronoi diagrams, Delaunay Triangulation of Imprecise Points Simplified and Extended