Conference
Distributed fast marching methods
Abstract
Fast Marching represents a very efficient technique for solving the front propagation problems which can be formulated as boundary value partial differential equations |T(x, y)| = 1/F(x, y) on , with Dirichlet boundary condition T(x, y) = 0 on . We show that the problem of computing the distance map across a smooth sampling domain can be posed in the form of such a partial differential equation, called Eikonal Equation and outline the Fast …
Authors
Tugurlan MC; Bourdin B
Pagination
pp. 1-1
Publisher
Association for Computing Machinery (ACM)
Publication Date
January 29, 2008
DOI
10.1145/1341811.1341843
Name of conference
Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities