Polygonal representation by edge k-d trees

Abstract A new data structure, namely the edge k-d tree for polygonal data is presented here. This data structure is an improvement over the conventional k-d tree and the quadtree. The edge k-d tree is of O(log N ) height and is balanced, whereas the quadtree does not have these properties. Unlike the conventional k-d tree, the edge k-d tree has both boundary and areal information. Moreover, the edge k-d tree does not change its structure when the polygon is translated or scaled. Thus, the proposed method is superior to many other existing schemes of representing polygons.