Robust and Efficient Surface Reconstruction From Range Data - École des Ponts ParisTech Access content directly
Journal Articles Computer Graphics Forum Year : 2009

Robust and Efficient Surface Reconstruction From Range Data


We describe a robust but simple algorithm to reconstruct a surface from a set of merged range scans. Our key contribution is the formulation of the surface reconstruction problem as an energy minimisation problem that explicitly models the scanning process. The adaptivity of the Delaunay triangulation is exploited by restricting the energy to inside/outside labelings of Delaunay tetrahedra. Our energy measures both the output surface quality and how well the surface agrees with soft visibility constraints. Such energy is shown to perfectly fit into the minimum s - t cuts optimisation framework, allowing fast computation of a globally optimal tetrahedra labeling, while avoiding the "shrinking bias" that usually plagues graph cuts methods. The behaviour of our method confronted to noise, undersampling and outliers is evaluated on several data sets and compared with other methods through different experiments: its strong robustness would make our method practical not only for reconstruction from range data but also from typically more difficult dense point clouds, resulting for instance from stereo image matching. Our effective modeling of the surface acquisition inverse problem, along with the unique combination of Delaunay triangulation and minimum s - t cuts, makes the computational requirements of the algorithm scale well with respect to the size of the input point cloud.


Other [cs.OH]

Dates and versions

hal-00712261 , version 1 (26-06-2012)



Patrick Labatut, Jean-Philippe Pons, Renaud Keriven. Robust and Efficient Surface Reconstruction From Range Data. Computer Graphics Forum, 2009, 28 (8), pp.2275-2290. ⟨10.1111/j.1467-8659.2009.01530.x⟩. ⟨hal-00712261⟩
740 View
0 Download



Gmail Facebook X LinkedIn More