Feature-Preserving Surface Reconstruction and Simplification from Defect-Laden Point Sets

We propose a robust, feature-preserving surface reconstruction algorithm which turns a point set with noise and outliers into a low triangle-count simplicial complex. Our approach starts with a simplicial complex filtered from a 3D Delaunay triangulation of the input points. This initial approximation is iteratively simplified based on the optimal cost to transport the point set to the simplicial complex, both seen as measures (or mass distributions). Our optimal transport formulation allows the recovery of sharp features even in the presence of a large amount of outliers and/or noise in the input set.

Data and Resources

Additional Info

Field Value
Source https://inria.hal.science/hal-00706712
Author Digne, Julie, Cohen-Steiner, David, Alliez, Pierre, Desbrun, Mathieu, de Goes, Fernando
Maintainer CCSD
Last Updated May 15, 2026, 20:14 (UTC)
Created May 15, 2026, 20:14 (UTC)
Identifier Report N°: RR-7991
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Geometric computing (GEOMETRICA) ; Centre Inria d'Université Côte d'Azur ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Saclay ; Institut National de Recherche en Informatique et en Automatique (Inria)
creator Digne, Julie
date 2012-06-11T00:00:00
harvest_object_id 58fd4d2d-cfbc-4b0c-82df-7e2f5c85c48b
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-09-15T00:00:00
relation info:eu-repo/grantAgreement//257474/EU/Robust Geometry Processing/IRON
set_spec type:REPORT