Occlusion points propagation geodesic distance transformation

In this paper, we propose a new approach to compute geodesic distance transformations in arbitrary 2D and 3D domains. The distance transformation proposed here is robust and has proved to have a computational complexity linear in the domain size. Our scheme is based on a new technique which we call occlusion points propagation, and with a higher accuracy than other geodesic distance transformations proposed before. We validate the algorithm with a set of synthetic domains, and we also make comparisons with two similar algorithms called B/sub d/-geodesic distance transformation and B/sub d/-geodesic distance transformation with circular propagation.