DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).

DOI10.1016/S0010-4485(97)00082-1zbMath1035.68122OpenAlexW2149616971WikidataQ56047094 ScholiaQ56047094MaRDI QIDQ1401886

P. Cignoni, C. Montani, Roberto Scopigno

Publication date: 24 September 2003

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0010-4485(97)00082-1

zbMATH Keywords

uniform grids

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (26)

The Delaunay triangulation learner and its ensembles ⋮ Angle-bounded 2D mesh simplification ⋮ Unnamed Item ⋮ Feature-based multiresolution techniques for product design ⋮ Reducing complexity in polygonal meshes with view-based saliency ⋮ Mesh simplification using an area-based distortion measure ⋮ A mesh‐based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems ⋮ Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel ⋮ A spectral segmentation method for large meshes ⋮ Parallel computation of alpha complexes for biomolecules ⋮ Optimal Lagrange interpolation by quartic \(C^1\) splines on triangulations ⋮ Solutions to the Minimum Variance Problem Using Delaunay Triangulation ⋮ Load-Balancing for Parallel Delaunay Triangulations ⋮ Design of computer experiments: space filling and beyond ⋮ Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets ⋮ TRIOPT: A triangulation-based partitioning algorithm for global optimization ⋮ A model to simplify 2D triangle meshes with irregular shapes ⋮ Computational Geometry Methods and Intelligent Computing ⋮ Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations ⋮ Polyhedral GPU Accelerated Shape from Silhouette ⋮ RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point ⋮ DeWall ⋮ Reducing Urban Concentration Using a Neural Network Model ⋮ An efficient simplification method for point cloud based on salient regions detection ⋮ A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case ⋮ Out-of-core Constrained Delaunay Tetrahedralizations for Large Scenes

This page was built for publication: DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).