I need to compile a R Tree program in C and along with algor

I need to compile a R Tree program in C++ and along with algorithm plz give me expalation of program line by line

Solution

few weeks in the past I finished preliminary work on an R* Tree implementation in C++. My goal for this implementation is as follows:

easy API – most current implementations I’ve seen are a ways from simple
widely wide-spread enough to use with most sorts, with low overhead
N dimensions for bounding boxes
clean to combine and use for Roadnav
Take advantage of present day C++ capabilities to get decent performance
that is a header-most effective implementation of an R tree with an R* index, and makes heavy use of templates, STL, and STL-style functors; however it need to paintings in any relatively contemporary C++ compiler. To do looking for nodes, this implementation uses the traveller sample thru functors — there are examples and documentation in RStarVisitor.h.

in case you use this, *please* let me realize, I’m very fascinated to look what bugs may also arise, and possible performance problems. unfortunately, I haven’t gotten around to writing any comprehensive assessments for it (however given the exams I’ve run thus far, I’m fairly positive the implementation is broadly speaking accurate), however I count on that when i am getting it incorporated into Roadnav that this may follow quickly after. also, integration of the R* tree into Roadnav will make quite a few potential mistakes pop out. search for this in the close to destiny.

moreover, i am thinking about a number of the subsequent ideas too:

including the ability to work with greater-large datasets via saving/loading to/from disk (after all, that is the point of R trees…)
including a bulk insert feature — there\'s pseudocode already for this, but I haven’t certainly written an implementation for this but. additionally, a more green bulk delete characteristic
trying to implement it as a lift intrusive box. I’ve been gambling with a few boost stuff these days at paintings, and theres quite a few neat things there.
I’ll additionally use this opportunity to install a plug for Roadnav — in case you’re seeking to paintings on an open supply assignment, theres a gaggle of (primarily) exciting stuff that I’m working on/making plans for Roadnav. What I’m working on right now could be totally getting rid of US-particular stuff from Roadnav, and moving to an OpenStreetMap-only implementation. Theres some of capabilities which can be getting thrown away, but I assume that the dynamic community that OSM opens as much as Roadnav might be properly well worth it.

notice: I’ve up to date this quite a chunk (though, eliminate functionality has been removed and it now not makes use of the traveler sample for data access), and its currently part of libsdbx. Libsdbx can be discovered in Roadnav SVN at https://roadnav.svn.sourceforge.net/svnroot/roadnav/libsdbx/trunk/. I’ll write about this soon.. but its pretty neat. It supports R* and modified B+ trees, in memory or on disk. take a look at it ou