文件名称:prtree-1.7.tar
介绍说明－－下载内容均来自于网络，请自行研究使用
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. -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.
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. -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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
65520766prtree-1.7.tar