Title :
A sampling theorem for MLS surfaces
Author :
Bremer, P.-T. ; Hart, J.C.
Author_Institution :
Univ. of Dlinois, Urbana, IL, USA
Abstract :
Recently, point set surfaces has been the focus of a large number of research efforts. Several different methods have been proposed to define surfaces from points and have been used in a variety of applications. However, so far little is know about the mathematical properties of the resulting surface. A central assumption for most algorithms is that the surface construction is well defined within a neighborhood of the samples. However, it is not clear that given an irregular sampling of a surface this is the case. The fundamental problem is that point based methods often use a weighted least squares fit of a plane to approximate a surface normal. If this minimization problem is ill-defined so is the surface construction. In this paper, we provide a proof that given reasonable sampling conditions the normal approximations are well defined within a neighborhood of the samples. Similar to methods in surface reconstruction, our sampling conditions are based on the local feature size and thus allow the sampling density to vary according to geometric complexity.
Keywords :
computational complexity; computational geometry; minimisation; surface fitting; surface reconstruction; MLS surfaces; geometric complexity; minimization problem; point set surface; sampling theorem; surface normal approximation; surface reconstruction; weighted least squares fit; Facial animation; Filtering; Filters; Least squares approximation; Multilevel systems; Noise shaping; Robustness; Sampling methods; Scattering; Surface reconstruction;
Conference_Titel :
Point-Based Graphics, 2005. Eurographics/IEEE VGTC Symposium Proceedings
Conference_Location :
Stony Brook, NY, USA
Print_ISBN :
3-905673-20-7
DOI :
10.1109/PBG.2005.194063