Perl R-Tree

punkish has asked for the wisdom of the Perl Monks concerning the following question:

Monks,

I am looking for a Perl implementation of R-Tree (spatial indexes). I am aware of the only one on CPAN Tree::R, but that hasn't been tended in ages and has very poor documentation.

My primary purpose is to learn more about R-Trees, more than I can learn from http://www.rtreeportal.org/, by reading Guttman's paper http://www.informatik.uni-trier.de/~ley/db/conf/sigmod/Guttman84.html and Beckmann et. al. http://www.informatik.uni-trier.de/~ley/db/conf/sigmod/BeckmannKSS90.html. I have also downloaded some basic C code, but I am more conversant with Perl than with C.

While Perl maybe an inappropriate language for implementing an R-Tree index because of speed reasons, it can be a great learning tool, and it can also be quite appropriate for small datasets.

Any pointers in this quest would be greatly appreciated.

--

when small people start casting long shadows, it is time to go to bed

Comment on Perl R-Tree

Replies are listed 'Best First'.
Re: Perl R-Tree by gamache (Friar) on May 06, 2008 at 20:12 UTC
While Perl maybe an inappropriate language for implementing an R-Tree index because of speed reasons, You might be surprised how fast Perl can run. For something like R-Trees, I'd expect a sensible Perl implementation to be almost as fast as C.	[reply]
Re: Perl R-Tree by samtregar (Abbot) on May 06, 2008 at 22:37 UTC
Tree::R looks great for learning about one might implement an R-Tree in pure Perl. If I was looking for something to actually use I'd probably prefer something that provides an interface to an existing robust, fast C implementation. If you create one, let us know! -sam	[reply]
Re: Perl R-Tree by salva (Canon) on May 07, 2008 at 08:44 UTC
Algorithm::RectanglesContainingDot is not an R-Tree implementation, but it covers part of the same problem space.	[reply]