On Tuesday, 22 October 2013 at 18:53:32 UTC, Craig Dillabaugh
wrote:
clip
Sadly for me, I was able to find it. Its a bit embarrassing but
the code can be found here in all its undocumented glory.
Likely
not state-of-the-art.
http://cg.scs.carleton.ca/~cdillaba/comp5409_project/code/index.html
Note, this was sort of an experimental R-tree, trying to test an
idea I was working with on performing bulk queries in external
memory. So are some extra's in there. I gave up on the idea
shortly thereafter - so that likely indicative of the quality of
the concept ... anyway it might help you understand the code:
http://cg.scs.carleton.ca/~cdillaba/comp5409_project/BatchSearch.html
Craig
If you look at the code in rect.h/rect.cpp there is code for
generating Hilbert values for the rectangles (that I can't
personally take credit for). It is sort of useful for
constructing balanced R-trees.
