ACM Home Page
Please provide us with feedback. Feedback
Robust reconstruction of watertight 3D models from non-uniformly sampled point clouds without normal information
Full text Publisher SitePublisher Site
Source
ACM International Conference Proceeding Series; Vol. 256 archive
Proceedings of the fourth Eurographics symposium on Geometry processing table of contents
Cagliari, Sardinia, Italy
SESSION: Mesh reconstruction table of contents
Pages: 41 - 50  
Year of Publication: 2006
ISBN ~ ISSN:1727-8384 , 30905673-36-3
Authors
Alexander Hornung  RWTH Aachen University
Leif Kobbelt  RWTH Aachen University
Sponsors
Eurographics: Eurographics Association
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
Eurographics Association  Aire-la-Ville, Switzerland, Switzerland
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

ABSTRACT

We present a new volumetric method for reconstructing watertight triangle meshes from arbitrary, unoriented point clouds. While previous techniques usually reconstruct surfaces as the zero level-set of a signed distance function, our method uses an unsigned distance function and hence does not require any information about the local surface orientation. Our algorithm estimates local surface confidence values within a dilated crust around the input samples. The surface which maximizes the global confidence is then extracted by computing the minimum cut of a weighted spatial graph structure. We present an algorithm, which efficiently converts this cut into a closed, manifold triangle mesh with a minimal number of vertices. The use of an unsigned distance function avoids the topological noise artifacts caused by misalignment of 3D scans, which are common to most volumetric reconstruction techniques. Due to a hierarchical approach our method efficiently produces solid models of low genus even for noisy and highly irregular data containing large holes, without loosing fine details in densely sampled regions. We show several examples for different application settings such as model generation from raw laser-scanned data, image-based 3D reconstruction, and mesh repair.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
 
4
{BC02} Boissonnat J.-D., Cazals F.: Smooth surface reconstruction via natural neighbour interpolation of distance functions. Comput. Geom. 22, 1--3 (2002), 185--203.
 
5
 
6
 
7
 
8
{BNK02} Borodin P., Novotni M., Klein R.: Progressive gap closing for mesh repairing. In Advances in Modelling, Animation and Rendering, Vince J., Earnshaw R., (Eds.). Springer Verlag, July 2002, pp. 201--213.
9
10
11
12
 
13
{DMGL02} Davis J., Marschner S. R., Garr M., Levoy M.: Filling holes in complex surfaces using volumetric diffusion. In 3DPVT (2002), pp. 428--438.
 
14
 
15
{EBV05} Esteve J., Brunet P., Vinacua A.: Approximation of a variable density cloud of points by shrinking a discrete membrane. Comput. Graph. Forum 24, 2 (2005), 791--807.
 
16
17
 
18
19
 
20
21
 
22
 
23
24
 
25
 
26
 
27
28
 
29
 
30
{PMG04} Pauly M., Mitra N., Guibas L.: Uncertainty and variability in point cloud surface data. In Eurographics Symposium on Point-Based Graphics (2004).
 
31
 
32
 
33
{SLS*06} Sharf A., Lewiner T., Shamir A., Kobbelt L., Cohen-Or D.: Competing fronts for coarse-to-fine surface reconstruction. In Eurographics (2006), p. to appear.
 
34
35


Collaborative Colleagues:
Alexander Hornung: colleagues
Leif Kobbelt: colleagues