An implementation of range trees with fractional cascading in C++

Details An implementation of range trees with fractional cascading in C++ An implementation of range trees with fractional cascading in C++

2011-03-23

arxiv.org/abs/1103.4521v1

Computer Science

Data Structures and Algorithms

Technical report

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An implementation of range trees with fractional cascading in C++ 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 An implementation of range trees with fractional cascading in C++, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An implementation of range trees with fractional cascading in C++ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-441356