Rory Plaire wrote:
I don't have a great deal of experience with various R-Trees, and the main reason for this is the paper on STR R-Trees which shows that they outperform
<snip>
experience, I've never really seen a Hilbert R-Tree, and I just assumed that STR trees were the state of the art, and reading the paper cemented this concept.
STR trees are very simple to implement, and produce rather good indexes. I read through the R-tree literature sometime around two years ago, and ended up implementing an STR tree because of its simplicity and expected performance.
The state of the art in R-Trees however is (and was back when I read up on the subject) the Priority R-Tree (PR tree), which is supposedly practical and worst-case optimal. I was enticed away from it by the near-trivial simplicity of STR.
There is a recent Java implementation available of in-memory PRTree at http://khelekore.org/prtree/. It would be interesting to see how it compares with the STR tree currently in JTS in terms of performance. Alas I don't seem to have the time to actually do any tests on them - perhaps someone else does?
_______________________________________________ jts-devel mailing list jts-devel@lists.jump-project.org http://lists.refractions.net/mailman/listinfo/jts-devel
