Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Guaranteeing the topology of an implicit surface polygonization for interactive modeling
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Proceedings of the conference on Visualization '01
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
Provable surface reconstruction from noisy samples
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
ACM SIGGRAPH 2004 Papers
ACM SIGGRAPH 2004 Papers
Fair morse functions for extracting the topological structure of a surface mesh
ACM SIGGRAPH 2004 Papers
Colorization using optimization
ACM SIGGRAPH 2004 Papers
Dual Marching Cubes: Primal Contouring of Dual Grids
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
Row Modifications of a Sparse Cholesky Factorization
SIAM Journal on Matrix Analysis and Applications
Spectral surface reconstruction from noisy point clouds
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
A sketch-based interface for detail-preserving mesh editing
ACM SIGGRAPH 2005 Papers
An Iterative Optimization Approach for Unified Image Segmentation and Matting
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Poisson surface reconstruction
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Computational Geometry: Theory and Applications
Space-time surface reconstruction using incompressible flow
ACM SIGGRAPH Asia 2008 papers
Curve skeleton extraction from incomplete point cloud
ACM SIGGRAPH 2009 papers
Fixing geometric errors on polygonal models: a survey
Journal of Computer Science and Technology
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Smoothing of partition of unity implicit surfaces for noise robust surface reconstruction
SGP '09 Proceedings of the Symposium on Geometry Processing
SMI 2011: Full Paper: Geometric models with weigthed topology
Computers and Graphics
Field-guided registration for feature-conforming shape composition
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
A Global Parity Measure for Incomplete Point Cloud Data
Computer Graphics Forum
Polygon mesh repairing: An application perspective
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
The reconstruction of a complete watertight model from scan data is still a difficult process. In particular, since scanned data is often incomplete, the reconstruction of the expected shape is an ill-posed problem. Techniques that reconstruct poorly-sampled areas without any user intervention fail in many cases to faithfully reconstruct the topology of the model. The method that we introduce in this paper is topology-aware: it uses minimal user input to make correct decisions at regions where the topology of the model cannot be automatically induced with a reasonable degree of confidence. We first construct a continuous function over a three-dimensional domain. This function is constructed by minimizing a penalty function combining the data points, user constraints, and a regularization term. The optimization problem is formulated in a mesh-independent manner, and mapped onto a specific mesh using the finite-element method. The zero level-set of this function is a first approximation of the reconstructed surface. At complex under-sampled regions, the constraints might be insufficient. Hence, we analyze the local topological stability of the zero level-set to detect weak regions of the surface. These regions are suggested to the user for adding local inside/outside constraints by merely scribbling over a 2D tablet. Each new user constraint modifies the minimization problem, which is solved incrementally. The process is repeated, converging to a topology-stable reconstruction. Reconstructions of models acquired by a structured-light scanner with a small number of scribbles demonstrate the effectiveness of the method.