Comparison of two dilation algorithms for a linear quadtree

Abstract The performances of two dilation algorithms for a linear quadtree are compared using a Vax-based algorithm development system. Both algorithms in their present form employ the chessboard distance metric. The ability to cope with other distance metrics is also discussed.

[1]  Hanan Samet,et al.  Computing Geometric Properties of Images Represented by Linear Quadtrees , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Hanan Samet,et al.  Distance Transform for Images Represented by Quadtrees , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  David C. Mason,et al.  Dilation algorithm for a linear quadtree , 1987, Image Vis. Comput..

[4]  Azriel Rosenfeld,et al.  Application of Hierarchical Data Structures to Geographical Information Systems. , 1983 .

[5]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[6]  M. J. Jackson,et al.  Spatially referenced methods of processing raster and vector data , 1983, Image Vis. Comput..