G.-P.: Deforming surface simplification based on dynamic geometry sampling

Although deforming surfaces are frequently used in nu-merous domains (scientific applications, games...), only few works have been proposed until now for simplifying such data. However, these time-varying surfaces are generally represented as oversampled triangular meshes with a static connectivity, involving a large number of unnecessary de-tails for some frames. Among the related works, some meth-ods provide globally good results, but fine details appearing during the animation are not always well-preserved, be-cause of a static geometry sampling. We propose a new simplification method for deforming surfaces based on a dynamic geometry sampling. The idea is to compute one coarse version at the first frame, and then to progressively update the coarse sampling for the subsequent frames. In order to optimally approximate each frame, vertices are added or removed following the appearance or disappear-ance of fine details in the frames. Our approach is fast, easy to implement, and produces good quality time-varying ap-proximations with well-preserved fine details, at any given frame. 1