Decimating samples for mesh simplification.
Tamal K. Dey, Joachim Giesen, James Francis Hudson · 2001
Modern scanning devices allow to obtain a dense sample of discrete points from the surface of a physical object. A piecewise linear surface interpolating these points is computed to reconstruct the sampled surface. Typically such surfaces have a large combinatorial description since the input is usually too dense. In this paper we present an algorithm to decimate the samples to eliminate oversampling. The algorithm decimates the sample with the guarantee that the remaining points are sufficient to reconstruct the surface and has a density controlled by an user input.