Learn More
A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in time linear in the total number of voxelsN. The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used for computing the DT for a wide class of distance functions, including the(More)
Thanks to Craig Boutilier for valuable discussions and for comments on earlier versions of this paper. [Ballard, 1983] B. W. Ballard. The-minimax search procedure for trees containing chance nodes. [Poole, 1993a] D. Poole. Logic programming, abduction and probability: A top-down anytime algorithm for computing prior and posterior probabilities. [Poole,(More)
  • 1