Key points are not available for this paper at this time.
We describe and demonstrate an algorithm that takes as input an unorganized set of points xl,. . . . xn ⊂ R3 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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Hugues Hoppe
Tony DeRose
Tom Duchamp
University of Washington
Building similarity graph...
Analyzing shared references across papers
Loading...
Hoppe et al. (Wed,) studied this question.
synapsesocial.com/papers/69df467a6324afb55d59210d — DOI: https://doi.org/10.1145/133994.134011