Two-layer quad trees: a data structure for high-speed interactive layout tools

Abstract

A two-layer quad tree data structure which creates an effective search environment for both region queries and size queries is described. A corner-based sorting method resolves the quad tree bisector list problem. A region-growing technique reduces region query search overhead. A two-layer quad tree implementation improves size-query speed. Experimental results show that these techniques significantly improve query speed for both classes of queries.<>