A sampling theorem for MLS surfaces

Abstract

Recently, point set surfaces have 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.