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.
منابع مشابه
Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry
Using the notions of Q-heaps and fusion trees developed by Fredman and Willard, we develop general transformation techniques to reduce a number of computational geometry problems to their special versions in partially ranked spaces. In particular, we develop a fast fractional cascading technique, which uses linear space and enables sublogarithmic iterative search on catalog trees in the case wh...
متن کاملFast Fractional Cascading and Its Applications ( CS - TR - 4502 & UMIACS - TR - 2003 - 71 )
Using the notions of Q-heaps and fusion trees developed by Fredman and Willard, we develop a faster version of the fractional cascading technique while maintaining the linear space structure. The new version enables sublogarithmic iterative search in the case when we have a search tree and the degree of each node is bounded by O(log n), for some constant > 0, where n is the total size of all th...
متن کاملFast Fractional Cascading and Its Applications
Using the notions of Q heaps and fusion trees developed by Fredman and Willard we develop a faster version of the fractional cascading technique while maintaining the linear space structure The new version enables sublogarithmic iterative search in the case when we have a search tree and the degree of each node is bounded by O log n for some constant where n is the total size of all the lists s...
متن کاملPosition-Restricted Substring Searching
A full-text index is a data structure built over a text string T [1, n]. The most basic functionality provided is (a) counting how many times a pattern string P [1,m] appears in T and (b) locating all those occ positions. There exist several indexes that solve (a) in O(m) time and (b) in O(occ) time. In this paper we propose two new queries, (c) counting how many times P [1,m] appears in T [l, ...
متن کامل9.1 Windowing Queries 9.2 Interval Trees
Windowing queries answer important questions. Primarily, windowing queries answer information involving a given line segment and a windowing region. Given a set of n line segments S and a query window W := [x : x ]x[y : y ], windowing queries answer which segments in S intersect W. The primary difference between windowing queries and range queries is the data. While range queries are associated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1103.4521 شماره
صفحات -
تاریخ انتشار 2011