A QuadTree Algorithm class in pure Perl

Edit Package perl-Algorithm-QuadTree
http://search.cpan.org/dist/Algorithm-QuadTree/

Algorithm::QuadTree implements a quadtree algorithm (QTA) in pure Perl. Essentially, a QTA is used to access a particular area of a map very quickly. This is especially useful in finding objects enclosed in a given region, or in detecting intersection among objects. In fact, I wrote this module to rapidly search through objects in a Tk::Canvas widget, but have since used it in other non-Tk programs successfully. It is a classic memory/speed trade-off.

Lots of information about QTAs can be found on the web. But, very briefly, a quadtree is a hierarchical data model that recursively decomposes a map into smaller regions. Each node in the tree has 4 children nodes, each of which represents one quarter of the area that the parent represents. So, the root node represents the complete map. This map is then split into 4 equal quarters, each of which is represented by one child node. Each of these children is now treated as a parent, and its area is recursively split up into 4 equal areas, and so on up to a desired depth.

Refresh
Refresh
Source Files
Filename Size Changed
Algorithm-QuadTree-0.5.tar.gz 0000016830 16.4 KB
cpanspec.yml 0000000923 923 Bytes
perl-Algorithm-QuadTree.changes 0000001719 1.68 KB
perl-Algorithm-QuadTree.spec 0000004569 4.46 KB
Latest Revision
Stephan Kulow's avatar Stephan Kulow (coolo) accepted request 1037661 from Tina Müller's avatar Tina Müller (tinita) (revision 8)
- updated to 0.5
   see /usr/share/doc/packages/perl-Algorithm-QuadTree/Changes
  0.5   
  	[Other changes]
  		- greatly increase pure Perl search performance
  		- improve guts code quality
  0.4   
  	[Other changes]
  		- use List::Util for better search performance if it is available
Comments 0
openSUSE Build Service is sponsored by