Proceedings ArticleDOI
The power crust
Nina Amenta,Sunghee Choi,Ravi Krishna Kolluri +2 more
- pp 249-266
TLDR
A careful design of a key subroutine which labels parts of the MAT as inside or outside of the object, easy in theory but non-trivial in practice is described, which leads to a simple algorithm with theoretical guarantees comparable to those of other surface reconstruction and medial axis approximation algorithms.Abstract:
The power crust is a construction which takes a sample of points from the surface of a three-dimensional object and produces a surface mesh and an approximate medial axis. The approach is to first approximate the medial axis transform (MAT) of the object. We then use an inverse transform to produce the surface representation from the MAT.This idea leads to a simple algorithm with theoretical guarantees comparable to those of other surface reconstruction and medial axis approximation algorithms. It also comes with a guarantee that does not depend in any way on the quality of the input point sample. Any input gives an output surface which is the `watertight' boundary of a three-dimensional polyhedral solid: the solid described by the approximate MAT. This unconditional guarantee makes the algorithm quite robust and eliminates the polygonalization, hole-filling or manifold extraction post-processing steps required in previous surface reconstruction algorithms.In this paper, we use the theory to develop a power crust implementation which is indeed robust for realistic and even difficult samples. We describe the careful design of a key subroutine which labels parts of the MAT as inside or outside of the object, easy in theory but non-trivial in practice. We find that we can handle areas in which the input sampling is scanty or noisy by simply discarding the unreliable parts of the MAT approximation. We demonstrate good empirical results on inputs including models with sharp corners, sparse and unevenly distributed point samples, holes, and noise, both natural and synthetic.We also demonstrate some simple extensions: intentionally leaving holes where there is no data, producing approximate offset surfaces, and simplifying the approximate MAT in a principled way to preserve stable features.read more
Citations
More filters
Proceedings ArticleDOI
Poisson surface reconstruction
TL;DR: A spatially adaptive multiscale algorithm whose time and space complexities are proportional to the size of the reconstructed model, and which reduces to a well conditioned sparse linear system.
Journal ArticleDOI
Screened poisson surface reconstruction
Michael Kazhdan,Hugues Hoppe +1 more
TL;DR: This work extends Poisson surface reconstruction to explicitly incorporate the points as interpolation constraints and presents several algorithmic improvements that together reduce the time complexity of the solver to linear in the number of points, thereby enabling faster, higher-quality surface reconstructions.
Journal Article
Automatic Reconstruction of As-Built Building Information Models from Laser-Scanned Point Clouds: A Review of Related Techniques | NIST
TL;DR: A survey of state-of-the-art methods for automated as-built BIM creation can be found in this article, where the main methods used by these algorithms for representing knowledge about shape, identity, and relationships.
Proceedings ArticleDOI
Skeleton based shape matching and retrieval
TL;DR: The method encodes the geometric and topological information in the form of a skeletal graph and uses graph matching techniques to match the skeletons and to compare them and also describes a visualization tool to aid in the selection and specification of the matched objects.
Journal ArticleDOI
An autonomous mobile robot with a 3D laser range finder for 3D exploration and digitalization of indoor environments
TL;DR: An automatic system for gaging and digitalization of 3D indoor environments with an autonomous mobile robot, a reliable 3D laser range finder and three elaborated software modules is presented.
References
More filters
Proceedings ArticleDOI
Surface simplification using quadric error metrics
Michael Garland,Paul S. Heckbert +1 more
TL;DR: This work has developed a surface simplification algorithm which can rapidly produce high quality approximations of polygonal models, and which also supports non-manifold surface models.
Proceedings ArticleDOI
A volumetric method for building complex models from range images
Brian Curless,Marc Levoy +1 more
TL;DR: This paper presents a volumetric method for integrating range images that is able to integrate a large number of range images yielding seamless, high-detail models of up to 2.6 million triangles.
Proceedings ArticleDOI
Progressive meshes
TL;DR: The progressive mesh (PM) representation is introduced, a new scheme for storing and transmitting arbitrary triangle meshes that addresses several practical problems in graphics: smooth geomorphing of level-of-detail approximations, progressive transmission, mesh compression, and selective refinement.
Proceedings ArticleDOI
Surface reconstruction from unorganized points
TL;DR: A general method for automatic reconstruction of accurate, concise, piecewise smooth surfaces from unorganized 3D points that is able to automatically infer the topological type of the surface, its geometry, and the presence and location of features such as boundaries, creases, and corners.
Book
Algorithms in Combinatorial Geometry
TL;DR: This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems with an important role in this study.