Simple and Scalable Surface Reconstruction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2016

Simple and Scalable Surface Reconstruction

Dobrina Boltcheva
  • Function : Author
  • PersonId : 884271
Bruno Lévy


We present a practical reconstruction algorithm that generates a surface triangulation from an input pointset. In the result, the input points appear as vertices of the generated triangulation. The algorithm has several interesting properties: it is very simple to implement, it is time and memory efficient, and it is trivially parallelized. On a standard hardware (core i7, 16Gb) it takes less than 10 seconds to reconstruct a surface from 1 million points, and scales-up to 36 million points (then it takes 350 seconds). On a telephone (ARMV7 Neon, quad core), it takes 55 seconds to reconstruct a surface from 900K points. The algorithm computes the Delaunay triangulation of the input pointset restricted to a "thickening" of the pointset (similarly to several existing methods, like alpha-shapes, crust and co-cone). By considering the problem from the Voronoi point of view (rather than Delaunay), we use a simple observation (radius of security) that makes the problem simpler. The Delaunay triangulation data structure and associated algorithms are replaced by simpler ones (KD-Tree and convex clipping) while the same set of triangles is provably obtained. The restricted Delaunay triangulation can thus be computed by an algorithm that is not longer than 200 lines of code, memory efficient and parallel. The so-computed restricted Delaunay triangulation is finally post-processed to remove the non-manifold triangles that appear in regions where the sampling was not regular/dense enough. Sensitivity to outliers and noise is not addressed here. Noisy inputs need to be pre-processed with a pointset filtering method. In the presented experimental results, we are using two iterations of projection onto the best approximating plane of the 30 nearest neighbours (more sophisticated ones may be used if the input pointset has many outliers).
Fichier principal
Vignette du fichier
SSSR.pdf (23.42 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01349023 , version 1 (07-09-2016)
hal-01349023 , version 2 (07-09-2016)


  • HAL Id : hal-01349023 , version 1


Dobrina Boltcheva, Bruno Lévy. Simple and Scalable Surface Reconstruction. [Research Report] LORIA - Université de Lorraine; INRIA Nancy. 2016. ⟨hal-01349023v1⟩
748 View
1186 Download


Gmail Facebook Twitter LinkedIn More