Voronoi diagrams from convex hulls
From MaRDI portal
Publication:1135110
DOI10.1016/0020-0190(79)90074-7zbMath0424.68036WikidataQ56070313 ScholiaQ56070313MaRDI QIDQ1135110
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90074-7
convex hull; computational geometry; algorithm for constructing a planar Euclidean Voronoi; K-dimensional Euclidean Voronoi diagram
68Q25: Analysis of algorithms and problem complexity
52A10: Convex sets in (2) dimensions (including convex curves)
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
68R99: Discrete mathematics in relation to computer science
Related Items
Voronoi Diagrams of Moving Points, Randomized incremental construction of abstract Voronoi diagrams, Algorithms for weak and wide separation of sets, An axiomatic approach to Voronoi-diagrams in 3D, The farthest point Delaunay triangulation minimizes angles, The \(\gamma\)-neighborhood graph, An optimal convex hull algorithm in any fixed dimension, Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\), Graph-theoretical conditions for inscribability and Delaunay realizability, Randomized incremental construction of simple abstract Voronoi diagrams in 3-space, Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation, Average case analysis of dynamic geometric optimization, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, On Delaunay oriented matroids for convex distance functions, Three-dimensional convex hull as a fruitful source of diagrams, ``The big sweep: On the power of the wavefront approach to Voronoi diagrams, An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram, Edge insertion for optimal triangulations, Unnamed Item
