Efficient Simplification of Point-Sampled Surfaces

In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchical clustering, iterative simplification, and particle simulation algorithms to create approximations of point-based models with lower sampling density. All these methods work directly on the point cloud, requiring no intermediate tesselation. We show how local variation estimation and quadric error metrics can be employed to diminish the approximation error and concentrate more samples in regions of high curvature. To compare the quality of the simplified surfaces, we have designed a new method for computing numerical and visual error estimates for point-sampled surfaces. Our algorithms are fast, easy to implement, and create high-quality surface approximations, clearly demonstrating the effectiveness of point-based surface simplification.

• Type: Conference
• Year: 2002
• Where: VISUALIZATION
• Authors: Mark Pauly, Markus H. Gross, Leif Kobbelt
• Keywords: Point-based Surface Simplification, Surface Simplification, Surface Simplification Methods, Visualization, VISUALIZATION 2002