Shaffer, Clifford A.Stout, Quentin F.2013-06-192013-06-191989-08-01http://hdl.handle.net/10919/19480Linear 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.application/pdfenIn CopyrightTechnical reportTR-89-07http://eprints.cs.vt.edu/archive/00000144/01/TR-89-07.pdf