| Name : perl-Algorithm-SpatialIndex
| |
| Version : 0.06
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp155.8.1
| Date : 2023-07-20 18:26:00
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Algorithm-SpatialIndex-0.06-lp155.8.1.src.rpm
|
| Size : 0.10 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : Flexible 2D/3D spacial indexing
|
Description :
A generic implementation of spatial (2D and 3D) indexes with support for
pluggable algorithms (henceforth: _strategies_) and storage backends.
Right now, this package ships with a quad tree implementation
(Algorithm::SpatialIndex::Strategy::QuadTree), an experimental oct tree (3D
indexing, Algorithm::SpatialIndex::Strategy::OctTree), an in-memory storage
backend (Algorithm::SpatialIndex::Storage::Memory), and an experimental
database-backed storage (Algorithm::SpatialIndex::Storage::DBI),
*NOTE: This is an experimental release. There must be bugs.*
The functionality is split between pluggable storage backends (see
Algorithm::SpatialIndex::Storage) and _strategies_ (see
Algorithm::SpatialIndex::Strategy, the latter of which implement the actual
indexing algorithm, usually some form of tree.
For the basic quad tree (Algorithm::SpatialIndex::Strategy::QuadTree) and
oct tree strategies, the tree is built from Algorithm::SpatialIndex::Nodes.
For each leaf node of the tree, the storage contains a _bucket_
(Algorithm::SpatialIndex::Bucket). The buckets are basically dumb, linear
complexity storage for items. Each item is simply an array reference
containing an id followed by two or more coordinates. The dimensionality
depends on the strategy. For example, quad trees are two-dimensional, oct
trees three-dimensional.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-A/15.5/noarch |
