Studies on R-tree spatial index for 3D GIS
Yan Liu · Cehui kexue · 2010
The establishment of high-performance 3D spatial data index is one of the key technologies in 3D GIS.And R-tree index is one of the most widely used methods in recent years.This paper employs the 3D coverage volume and 3D overlap volume as the R-tree insertion criteria and includes the k-means clustering method to improve the node splitting algorithm.In addition,the larger features such as roads,rivers in three-dimensional GIS can be cut out.So that the overlap of R-tree sibling nodes is minimized drastically,clustering of objects in space becomes more reasonable and the query speed of 3D GIS database is increased effectively.