1987

Parallel algorithms for approximation of distance maps on parametric surfaces

Ofir Weber, Yohai S. Devir, Alexander M. Bronstein, Michael M. Bronstein, Ron Kimmel
Department of Computer Science, Technion-Israel Institute of Technology, Haifa 32000, Israel
ACM Trans. Graph., Vol. 27, No. 4. (2008), pp. 1-16

@article{weber2008parallel,

   title={Parallel algorithms for approximation of distance maps on parametric surfaces},

   author={Weber, O. and Devir, Y.S. and Bronstein, A.M. and Bronstein, M.M. and Kimmel, R.},

   journal={ACM Transactions on Graphics (TOG)},

   volume={27},

   number={4},

   pages={1–16},

   issn={0730-0301},

   year={2008},

   publisher={ACM}

}

Download Download (PDF)   View View   Source Source   

810

views

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.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: