Constriction Computation using Surface Curvature
Résumé
This paper provides a curvature-based algorithm to compute locally shortest geodesics on closed triangulated surfaces. These curves, which are called ``constrictions'', are useful for shape segmentation. The key idea of the algorithm is that constrictions are almost plane curves; it first finds well-located simple, plane, closed curves, and then slides them along the surface until a shortest geodesic is reached. An initial curve is defined as a connected component of the intersection between the surface and a plane going through an initial vertex. Initial vertices and planes are determined using approximations of surface curvature.
Fichier principal
Het05.pdf (2.3 Mo)
Télécharger le fichier
curv_bunny-10000.png (4.02 Mo)
Télécharger le fichier
res_bunny-10000.png (791.8 Ko)
Télécharger le fichier
res_star4-5120.png (624.09 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
| Format | Figure, Image |
|---|
| Format | Figure, Image |
|---|
| Format | Figure, Image |
|---|