Comparison of two dilation algorithms for a linear quadtree

摘要

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.