Description: Since objects stored in a spatial can be rather
complex they are often approximated by simpler objects,
and spatial indexes are then built on these approximations.
The most commonly used approximation is the minimal
bounding box: the smallest axis-parallel (hyper-) rectangle
that contains the object.
To Search:
File list (Check if you may need any files):
65520766prtree-1.7.tar
Download