Abstract
We present an efficient O(n) numerical algorithm for first-order approximation of geodesic distances on geometry images, where n is the number of points on the surface. The structure of our algorithm allows efficient implementation on parallel architectures. Two implementations on a SIMD processor and on a GPU are discussed. Numerical results demonstrate up to four orders of magnitude improvement in execution time compared to the state-of-the-art algorithms.
Original language | English |
---|---|
Article number | 104 |
Journal | ACM Transactions on Graphics |
Volume | 27 |
Issue number | 4 |
DOIs | |
State | Published - 1 Oct 2008 |
Externally published | Yes |
Keywords
- Eikonal equation
- Fast marching
- GPU
- Geodesic distances
- Geometry image
- Multiple charts
- Parallel algorithms
- SIMD