The circle tree - a hierarchical structure for efficient storage, access and multi-scale representation of spatial data
The circle tree - a hierarchical structure for efficient storage, access and multi-scale representation of spatial data
复制标题
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
A. Moore
中科院分区：
文献类型：
--
作者：
A. Moore
为了实现多边形空间数据的高效存储、访问和多尺度表示，提出了一种层次树结构——圆形树。该树通过最优递归地放置大小递减的圆来填充多边形，实现近空间填充效果。本文在计算机科学（例如，使用体积填充球体进行快速3D碰撞检测）和GIS文献（例如，球体树作为Rtree索引方法的替代方法）中建立了圆树的先例，并解释了它的发展如何建立在这些思想的基础上。然后将给出一个项目大纲，描述确定性导出的解与通过进化计算获得的解的比较。最后，将简要评估圆形树如何促进有效的存储和访问以及在多个尺度上表示空间对象（并在此过程中执行减少和消除的制图过程）。
A hierarchical tree structure, the circle tree, is proposed for the efficient storage, access and multi-scale representation of polygonal spatial data. The tree is built by optimally and recursively placing circles of decreasing size to fill a polygon, achieving a near-space filling effect. This paper establishes the precedent for the circle tree in the computer science (e.g. use of volume-filling spheres for quick 3D collision detection) and GIS literature (e.g. the sphere tree as an alternative to the Rtree indexing method) and explains how its development may build on some of these ideas. A project outline describing the comparison of a deterministically derived solution with one gained through evolutionary computation will then be given. Finally, a brief assessment of how the circle tree may facilitate efficient storage and access as well as the representation of a spatial object at multiple scales (and in doing so performing the cartographic processes of reduction and elimination) will be made.