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.
2002_a.png
Thumbnail
openaccess
copyright
73.88 KB
PNG
343bec095f923a2313a1e3002b61915f
pauly_2002_ESP.pdf
openaccess
2.66 MB
Adobe PDF
c2a0392fb6713a3b1619b496065bc4f1