A simple yet efficient algorithm to turn one oriented triangular mesh connectivity into another
Résumé
This paper addresses the problem of efficiently turning the connectivity of an initial triangular mesh into a new one, using combinatorial edge flip operations only, excluding vertex insertion and deletion. More precisely, we provide a practical but provably good solution for determining a sequence of edge flips between two surface triangulations sharing the same topological genus and the same number of vertices, with a one-to-one correspondence between the vertices of the two meshes. This is original in that the sequence of edge flips can be determined without using any canonical geometric or topological configuration, classically acting as a pivot between the two triangulations. The paper identifies the main difficulties that must be overcome by this direct algorithm, putting in place the foundation for a generic strategy. An efficient instantiation of this strategy is then presented, with an algorithm that proceeds by successive conformation of the facets, through a region-growing mechanism. The effectiveness of this approach is illustrated by practical benchmarks.
Domaines
Géométrie algorithmique [cs.CG]
Fichier principal
A_simple_yet_efficient_algorithm_to_turn_one_oriented_triangular_mesh_connectivity_into_another.pdf (4.52 Mo)
Télécharger le fichier
Demo_1.mp4 (3.72 Mo)
Télécharger le fichier
Demo_2.mp4 (7.5 Mo)
Télécharger le fichier
Demo_3.mp4 (6.7 Mo)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
| Format | Vidéo |
|---|
| Format | Vidéo |
|---|
| Format | Vidéo |
|---|
Loading...