What people are saying - Write a review
We haven't found any reviews in the usual places.
Multidimensional Data Structures
Multidimensional Searching Problems
10 other sections not shown
Other editions - View all
amortized assume balanced tree binary search boundary chain compute constructed contains convex hull convex polygons coordinate cost da-trees data structure dd-trees decomposable searching problems defined discussion dist doubly linked list dynamic elements exercise face follows hence in-interval insertions and deletions intersection problem interval trees leaf Lemma linear lower bound node list number of edges O(n log orthogonal range queries pair paradigm path decomposition planar graph planar subdivision plane sweep pointer polygon trees polygonal chain prio priority field priority search tree range trees rebalancing rectangles recursive region root rotations search structure segment tree sequence simple polygon solution solve space O(n split split fields static data structure stored subtree sweep line tion triangulation update upper convex hull vertex Voronoi diagram weighted x-coordinate xrange y-structure