A new point cloud simplification algorithm
Carsten Moenning, Neil A. Dodgson · 2003
We present a new technique for the simplification of pointsampled geometry without any prior surface reconstruction. Using Fast Marching farthest point sampling for implicit surfaces and point clouds [1], we devise a coarse-tofine uniform or feature-sensitive simplification algorithm with user-controlled density guarantee. The algorithm is computationally and memory efficient, easy to implement and inherently allows for the generation of progressive and multiresolution representations of the input point set.