Abstract
Approaches to polygonal decomposition for hierarchical image representation are described. For planar decomposition, quad trees using square and triangular neighborhoods are found to be the only feasible methods, having the same computational complexity. For rigid images the choice of the appropriate tree type is determined by the grid topology. Triangular and square quad trees are appropriate for the triangular and square grids, whereas trees of order 7 are necessary for the hexagonal grid.
Sign-in/Register to access full text options 
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.
