Efficient Simplification of Point-Sampled Surfaces

Abstract

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.

View Slides

Extracted Key Phrases

050'04'06'08'10'12'14'16
Citations per Year

766 Citations

Semantic Scholar estimates that this publication has 766 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Pauly2002EfficientSO, title={Efficient Simplification of Point-Sampled Surfaces}, author={Mark Pauly and Markus H. Gross and Leif Kobbelt}, booktitle={IEEE Visualization}, year={2002} }