Biased Range Trees

Details Biased Range Trees Biased Range Trees

2008-06-17

arxiv.org/abs/0806.2707v1

Computer Science

Computational Geometry

Scientific paper

A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R^2 and a query distribution D for 2-sided orthogonal range counting queries. The expected query time for this data structure, when queries are drawn according to D, matches, to within a constant factor, that of the optimal decision tree for S and D. The memory and preprocessing requirements of the data structure are O(n log n).

Affiliated with

Also associated with

No associations

Rating

Biased Range Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Biased Range Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Biased Range Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-408066