Abstract
A dilation algorithm for a linear quadtree is presented. This can be used to expand the black regions of a region quadtree by a user-specified 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 with those obtained using an existing one-pass algorithm. The two-pass algorithm is faster than the one-pass for expansions of typical real images, and this speed increase becomes more pronounced as the expansion and the complexity of the image increase.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
