Massive Uniform Mesh Decimation via a Fast Intrinsic Delaunay Triangulation

Triangular meshes are still today the data structure at the main foundations of many computer graphics applications. With the increasing demand in content variety, a lot of effort has been and is being put into developing new algorithms to automatically generate and edit geometric assets, with a particular focus on 3D scans. However, this kind of content is often generated with a dramatically high resolution, making it impractical for a large variety of tasks. Furthermore, procedural assets and 3D scans largely suffer from poor geometry quality, which makes them unsuitable in various applications. We propose a new efficient technique for massively decimating dense meshes with high vertex count very quickly. The proposed method relies on a fast algorithm for computing geodesic farthest point sampling and Voronoi partitioning, and generates simplified meshes with high-quality uniform triangulations.