Author
Abstract
This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality of the approximation and avoids the generation of triangles with sharp corners. Its low computational complexity permits the approximation of very large sets of points.
)