Surface Reconstruction from Unorganized Points
Hugues Hoppe, Tony DeRose, Tom Duchamp, John A. McDonald, Werner Stuetzle
Abstract
We describe and demonstrate an algorithm that takes as input an unorganized set of points {x<sub>l</sub>, . . . . x<sub>n</sub>} ⊂ R<sup>3</sup> 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.
Topics & Concepts
Surface (topology)Manifold (fluid mechanics)CombinatoricsTopology (electrical circuits)MathematicsObject (grammar)Set (abstract data type)Variety (cybernetics)GeometrySurface reconstructionRange (aeronautics)Computer scienceAlgorithmArtificial intelligenceEngineeringProgramming languageMechanical engineeringAerospace engineeringComputer Graphics and Visualization TechniquesComputational Geometry and Mesh Generation3D Shape Modeling and Analysis