Linear time distance transforms for quadtrees

Linear time algorithms are given for computing the chessboard distance transform for both pointer-based and linear quadtree representations. Comparisons between algorithmic styles for the two representations are made. Both versions of the algorithm consist of a pair of tree traversals.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/29144/1/0000186.pd

Linear Time Distance Transforms for Quadtrees

Linear time algorithms are given for computing the chessboard distance transform for both pointer-based and linear quadtree representations. Comparisons between algorithmic styles for the two representations are made. Both versions of the algorithm consist of a pair of tree traversals