Approximating generalized distance functions on weighted triangulated surfaces with applications
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
In this paper, we present an intrinsic algorithm for isotropic mesh simplification. Starting with a set of unevenly distributed samples on the surface, our method computes the geodesic Delaunay triangulation with regard to the sample set and iteratively evolves the Delaunay triangulation such that the Delaunay edges become almost equal in length. Finally, our method outputs the simplified mesh by replacing each curved Delaunay edge with a line segment. We conduct experiments on numerous real-world models of complicated geometry and topology. The promising experimental results demonstrate that the proposed method is intrinsic and insensitive to initial mesh triangulation.