Data Structures and Algorithm Analysis - Computer Science at ...

Sec. 13.6 Projects 45713.11 Select any two of the point representations described in this chapter (i.e., thek-d tree, the PR quadtree, the bintree, and the point quadtree). Implementyour two choices and compare them over a wide range of data sets. Describewhich is easier to implement, which appears to be more space efficient, andwhich appears to be more time efficient.13.12 Implement a representation for a collection of (two dimensional) rectanglesusing a quadtree based on regular decomposition. Assume that the spacebeing represented is a square whose width and height are some power oftwo. Rectangles are assumed to have integer coordinates and integer widthand height. Pick some value c, and use as a decomposition rule that a regionis subdivided into four equal-sized regions whenever it contains more that crectangles. A special case occurs if all of these rectangles intersect at somepoint within the current region (because decomposing such a node wouldnever reach termination). In this situation, the node simply stores pointersto more than c rectangles. Try your representation on data sets of rectangleswith varying values of c.