Fast Wavefront Propagation (FWP) for Computing Exact Geodesic Distances on Meshes
Computing geodesic distances on triangle meshes is a fundamental problem in computational geometry and computer graphics. To date, two notable classes of algorithms, the Mitchell-Mount-Papadimitriou (MMP) algorithm and the Chen-Han (CH) algorithm, have been proposed. Although these algorithms can co...
| Publié dans: | IEEE transactions on visualization and computer graphics. - 1996. - 21(2015), 7 vom: 10. Juli, Seite 822-34 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , , , |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2015
|
| Accès à la collection: | IEEE transactions on visualization and computer graphics |
| Sujets: | Journal Article Research Support, Non-U.S. Gov't |
| Accès en ligne |
Volltext |