Dilation algorithm for a linear quadtree


‘4 dilation algorithm for a linear quadtree is presented. This can be used to expand the black regions of a region quadtree by a user-spectfied amount. The algorithm requires two traversals through the ordered quadtree leaf set, the second traversal being in the opposite direction to the first. No explicit neighbour finding is required. Timings are compared… (More)
DOI: 10.1016/0262-8856(87)90072-2


5 Figures and Tables

Slides referencing similar topics