Notes
The query that asks for all the intervals containing a given point, is often referred as stabbing query.
The segment tree is less efficient than the interval tree for range queries in one dimension, due to its higher storage requirement: O(nlogn) against the O(n) of the interval tree. The importance of the segment tree is that the segments within each node’s canonical subset can be stored in any arbitrary manner.
Another advantage of the segment tree is that it can easily be adapted to counting queries; that is, to report the number of segments containing a given point, instead of reporting the segments themselves. Instead of storing the intervals in the canonical subsets, it can simply store the number of them. Such a segment tree uses linear storage, and requires an O(log n) query time, so it is optimal.
A version for higher dimensions of the interval tree and the priority search tree does not exist, that is, there is no clear extension of these structures that solves the analogous problem in higher dimensions. But the structures can be used as associated structure of segment trees.
Read more about this topic: Segment Tree
Famous quotes containing the word notes:
“There are only two or three human stories, and they go on repeating themselves as fiercely as if they had never happened before; like the larks in this country, that have been singing the same five notes over for thousands of years.”
—Willa Cather (1873–1947)
“Or bid the soul of Orpheus sing
Such notes as, warbled to the string,
Drew iron tears down Pluto’s cheek,
And made Hell grant what love did seek;”
—John Milton (1608–1674)