An incremental algorithm for reconstruction of surfaces of arbitrary codimension

DOI10.1016/j.comgeo.2006.05.004zbMath1105.65018OpenAlexW1970145517MaRDI QIDQ857056

Daniel Z. Freedman

Publication date: 14 December 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.05.004

zbMATH Keywords

surface reconstructionDelaunay triangulationgraphical examplesincremental algorithmpoint clouds

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (2)

Non-manifold surface reconstruction from high-dimensional point cloud data ⋮ Representing implicit surfaces satisfying Lipschitz conditions by 4-dimensional point sets

Uses Software

• Powercrust

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth surface reconstruction via natural neighbour interpolation of distance functions
• Surface reconstruction by Voronoi filtering
• A simple algorithm for homeomorphic surface reconstruction
• Detecting undersampling in surface reconstruction
• The power crust, unions of balls, and the medial axis transform

This page was built for publication: An incremental algorithm for reconstruction of surfaces of arbitrary codimension