Surface reconstruction from unorganized points
- 1 July 1992
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGGRAPH Computer Graphics
- Vol. 26 (2), 71-78
- https://doi.org/10.1145/142920.134011
Abstract
We describe and demonstrate an algorithm that takes as input an unorganized set of points {x l , . . . . x n } ⊂ R 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be known in advance - all are inferred automatically from the data. This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from two-dimensional slices, and interactive surface sketching.Keywords
This publication has 14 references indexed in Scilit:
- Generalized implicit functions for computer graphicsACM SIGGRAPH Computer Graphics, 1991
- Volumetric shape description of range data using “Blobby Model”ACM SIGGRAPH Computer Graphics, 1991
- Contour tracing by piecewise linear approximationsACM Transactions on Graphics, 1990
- A Bayesian approach to reconstruction from incomplete projections of a multiple object 3D domainIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989
- Principal CurvesJournal of the American Statistical Association, 1989
- Direct least-squares fitting of algebraic surfacesACM SIGGRAPH Computer Graphics, 1987
- Data structure forsoft objectsThe Visual Computer, 1986
- Curvature-based representation of objects from range dataImage and Vision Computing, 1986
- An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined ManifoldSIAM Journal on Numerical Analysis, 1985
- Multidimensional divide-and-conquerCommunications of the ACM, 1980