Tree::R(3pm)

Tree::R3pm

Perl extension for the r-tree data structure and algorithms

Usage

  use Tree::R;
  my $rtree = Tree::R->new
  for my $object (@objects) {
      my @bbox = $object->bbox(); # (minx,miny,maxx,maxy)
      $rtree->insert($object,@bbox);
  }
  my @point = (123, 456); # (x,y)
  my @results;
  $rtree->query_point(@point,\@results);
  for my $object (@results) {
      # point is in object's bounding box
  }
  my @rect = (123, 456, 789, 1234); # (minx,miny,maxx,maxy)
  @results = ();
  $rtree->query_completely_within_rect(@rect,\@results);
  for my $object (@results) {
      # object is within rectangle
  }
  @results = ();
  $rtree->query_partly_within_rect(@rect,\@results);
  for my $object (@results) {
      # object's bounding box and rectangle overlap
  }

Overview

R-tree is a data structure for storing and indexing and efficiently looking up non-zero-size spatial objects.

Export

None by default.

Repository

<https://github.com/ajolma/Tree-R>

Releases

4 releases since Debian 10 (Buster); the text changed 2 times.

  1. 10
  2. 11
  3. 12–13

Author

Ari Jolma

From libtree-r-perl 0.072-3 in Debian 13 (Trixie). Parsed by carta from the page's man source.