摘要
三维地理信息系统空间数据库具有数据量大、空间实体关系复杂、空间操作计算量大等特点。为了提高检索效率,必须建立高效的空间索引机制。八叉树空间索引是对二维GIS中四叉树索引进行扩展的一种三维空间数据结构,具有思路简单、容易理解和实现、查询速度快的优点。本文首先阐述了线性八叉树空间索引的原理,然后重点介绍了线性八叉树空间索引的建立和查询算法。
In the 3D GIS database, there is a large quantity of data, spatial entities with complicated relationships, and a large quantity of space operations. In order to improve the search efficiency, we must establish a highly efficient spatial indexing mechanism. Octree index is an expansion of quadtree index. Its ideas are simple,easy-to-understand and easy-to-realize, and its query speed is high. This paper describes the principle of the linear octree spatial index,and then focuses on the establishment and the query algorithms of the linear octree spatial index.
出处
《计算机工程与科学》
CSCD
北大核心
2009年第2期61-63,共3页
Computer Engineering & Science
