On the complexity of d-dimensional Voronoi diagrams
From MaRDI portal
Publication:599355
DOI10.1007/BF01224932zbMath0414.52004MaRDI QIDQ599355
Publication date: 1980
Published in: Archiv der Mathematik (Search for Journal in Brave)
Related Items
Voronoi Diagrams of Moving Points, Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems, Simplex based space filling designs, Arbitrarily large neighborly families of symmetric convex polytopes, On the randomized construction of the Delaunay tree, An approximate algorithm for computing multidimensional convex hulls, Illuminating high-dimensional convex sets, Tetrahedrizing point sets in three dimensions, Representing stereo data with the Delaunay triangulation
Cites Work