An operation efficiency analysis on breadth first quadtree

Abstract

This paper proposes the method which traverses and codes the quadtree by breadth first. Quadtree coded by breadth first (breadth first quadtree) has the same compression ratio with the quadtree coded by depth first (depth first quadtree). In breadth first quadtree, nodes in high level and low level appear in level by level, not at random. This makes it better for operation efficiency, especially in geometric property operation (perimeter calculation, area calculation, search, object labelling, neighbor finding) which needs long operation time. In this paper we show the advantage of breadth first quadtree by the worst case analysis and the general case analysis.<>