Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
From MaRDI portal
Publication:1380808
DOI10.1007/PL00009327zbMath0892.68099OpenAlexW2055884227MaRDI QIDQ1380808
Chee-Keng Yap, Timothy M. Chan, Jack Scott Snoeyink
Publication date: 27 July 1998
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009327
Related Items
Space-efficient planar convex hull algorithms, Optimal partition trees, Computing the multicover bifiltration, Convex hulls of spheres and convex hulls of disjoint convex polytopes, A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations, Complexity of the Delaunay triangulation of points on polyhedral surfaces, 3D boundary recovery by constrained Delaunay tetrahedralization, Adaptive tetrahedral mesh generation by constrained Delaunay refinement, Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection, On Some Proximity Problems of Colored Sets, On constant factors in comparison-based geometric algorithms and data structures
