Parallel approximation of distance maps

作者: Yohai Devir , Alexander Bronstein , Michael Bronstein , Ofir Weber , Ron Kimmel

DOI:

关键词: GridEuclidean geometryRowManifoldCombinatoricsMathematicsDiscrete representation

摘要: Method for parallel approximation of distance maps on a discrete representation manifold, the method comprising: at least one Euclidean grid applied iterating over rows in first direction, and each row currently visited during calculating value single cell parallel, wherein is carried out according to predefined rule, using calculated respective cells immediately before row, are adjacent grid.

参考文章(17)
Alexander Bronstein, Michael Bronstein, Ron Kimmel, Facial recognition and the open mouth problem ,(2006)
Jared Hoberock, Keenan Crane, John C. Hart, Nathan A. Carr, Rectangular multi-chart geometry images symposium on geometry processing. pp. 181- 190 ,(2006) , 10.5555/1281957.1281981
David W. Paglieroni, A unified distance transform algorithm and architecture machine vision applications. ,vol. 5, pp. 47- 55 ,(1992) , 10.1007/BF01213529
Per-Erik Danielsson, Euclidean distance mapping Computer Graphics and Image Processing. ,vol. 14, pp. 227- 248 ,(1980) , 10.1016/0146-664X(80)90054-4
Alon Spira, Ron Kimmel, An efficient solution to the eikonal equation on parametric manifolds Interfaces and Free Boundaries. ,vol. 6, pp. 315- 327 ,(2004) , 10.4171/IFB/102
E. Dejnozkova, P. Dokladal, A parallel algorithm for solving the Eikonal equation international conference on acoustics, speech, and signal processing. ,vol. 3, pp. 325- 328 ,(2003) , 10.1109/ICASSP.2003.1199473