Sciweavers

Share
SGP
2003

Approximating and Intersecting Surfaces from Points

11 years 2 months ago
Approximating and Intersecting Surfaces from Points
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We present a surface approximation that is motivated by an efficient iterative ray intersection computation. On each point on a ray, a local normal direction is estimated as the direction of smallest weighted co-variances of the points. The normal direction is used to build a local polynomial approximation to the surface, which is then intersected with the ray. The distance to the polynomials essentially defines a distance field, whose zero-set is computed by repeated ray intersection. Requiring the distance field to be smooth leads to an intuitive and natural sampling criterion, namely, that normals derived from the weighted co-variances are well defined in a tubular neighborhood of the surface. For certain, well-chosen weight functions we can show that well-sampled surfaces lead to smooth distance field...
Anders Adamson, Marc Alexa
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SGP
Authors Anders Adamson, Marc Alexa
Comments (0)
books