Efficient Partition Trees for Range Searching
ثبت نشده
چکیده
We have seen the use of partition trees for range searching earlier. In this lecture an efficient partition scheme which achieves the optimal query time within polylog factors is described. See [4] and [5] for more details. There are several new ideas on which this scheme relies. The existence of “good” cuttings are central to the algorithm. In the next section some of the definitions and results on cuttings are reviewed.
منابع مشابه
Geometric Range Searching and Its Relatives
About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cient algorithms nor nontrivial lower bounds were known for most range-searching problems. A series of papers by Haussler and Welzl [161], Clarkson [88, 89], and Clarkson and Shor [92] not only marked the beginning of a new chapter in geometric searching, but also revitali...
متن کاملPii: S0925-7721(00)00022-5
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, but lower bounds show that if linear space is assumed, the problem cannot be solved in polylogarithmic time, except for the case of orthogonal ranges. In this paper we show that if one is willing to allow approximate ran...
متن کاملNew Combinatorial Properties and Algorithms for AVL Trees
In this thesis, new properties of AVL trees and a new partitioning of binary search trees named core partitioning scheme are discussed, this scheme is applied to three binary search trees namely AVL trees, weight-balanced trees, and plain binary search trees. We introduce the core partitioning scheme, which maintains a balanced search tree as a dynamic collection of complete balanced binary tre...
متن کاملCompressed Data Structures for Range Searching
We study the orthogonal range searching problem on points that have a significant number of geometric repetitions, that is, subsets of points that are identical under translation. Such repetitions occur in scenarios such as image compression, GIS applications and in compactly representing sparse matrices and web graphs. Our contribution is twofold. First, we show how to compress geometric repet...
متن کاملAn implementation of range trees with fractional cascading in C++
Range trees are multidimensional binary trees which are used to perform d-dimensional orthogonal range searching. In this technical report we study the implementation issues of range trees with fractional cascading, named layered range trees. We also document our implementation of range trees with fractional cascading in C++ using STL and generic programming techniques.
متن کامل