Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
From MaRDI portal
Publication:3052755
DOI10.1007/978-3-642-16007-3_1zbMath1309.68206arXiv0906.2760MaRDI QIDQ3052755
Ophir Setter, Micha Sharir, Dan Halperin
Publication date: 2 November 2010
Published in: Transactions on Computational Science IX (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.2760
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
68W20: Randomized algorithms
Related Items
Non-centered Voronoi Skeletons, The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs, Arrangements on parametric surfaces. I: General framework and infrastructure, Arrangements on parametric surfaces. II: Concretizations and applications, Computing the topology of Voronoï diagrams of parallel half-lines
Uses Software