Parallel algorithms for approximation of distance maps on parametric surfaces

Ofir Weber, Yohai S. Devir, Alexander M. Bronstein, Michael M. Bronstein, Ron Kimmel

Research output: Contribution to journalArticlepeer-review

101 Scopus citations


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 languageEnglish
Article number104
JournalACM Transactions on Graphics
Issue number4
StatePublished - 1 Oct 2008
Externally publishedYes


  • Eikonal equation
  • Fast marching
  • GPU
  • Geodesic distances
  • Geometry image
  • Multiple charts
  • Parallel algorithms
  • SIMD


Dive into the research topics of 'Parallel algorithms for approximation of distance maps on parametric surfaces'. Together they form a unique fingerprint.

Cite this