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...
| Veröffentlicht in: | IEEE transactions on visualization and computer graphics. - 1996. - 21(2015), 7 vom: 10. Juli, Seite 822-34 | 
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , , , | 
| Format: | Online-Aufsatz | 
| Sprache: | English | 
| Veröffentlicht: | 
            
            2015
         | 
| Zugriff auf das übergeordnete Werk: | IEEE transactions on visualization and computer graphics | 
| Schlagworte: | Journal Article Research Support, Non-U.S. Gov't | 
| Online verfügbar | 
                            Volltext |