tree are all expressed as their minimum bounding boxes. Then
the node comparability value is weighed with circum-sphere of the minimum bounding boxes. The minimum spanning tree is constructed based on the connected undirected graph of node comparability value
and the minimum spanning tree is divided into two sub-trees on the edge of the maximum weight
which gets effective for optimizing the structure of R
*-
tree and improving the efficiency of node splitting.
SUN Xiaoxia,SUN Dianzhu,LI Yanrui,et al.A fast mesh generation algorithm for unorganized points [J].China Mechanical Engineering,2006,17(S2):245-248.
BECKMASN N,KRIEGEL H P,SCHNEIDER R,et al.The R/sup*-tree: an efficient and robust access method for points and rectangles[C]∥Proceedings of SIGMOD. New York,USA: ACM, 1990:322-331.
ZHU Qing,GONG Jun,ZHANG Yeting.An efficient 3D R/sup*-tree spatial index method for virtual geographic environments [J].ISPRS Journal of Photogrammetry and Remote Sensing,2007,62(3):217-224.
HUANG Jixian,BAO Guangshu,XIA Bin.A dynamic R-tree index based on hybrid clustering algorithm [J].Journal of Central South University:Science and Technology,2006,37(2):366-370.
SUN Dianzhu,FAN Zhixian,LI Yanrui,et al.Research and application of surface feature analysis scatter data points [J].Chinese Journal of Mechanical Engineering,2007,43(6):133-136.
SUN Dianzhu,TIAN Zhongchao,LI Yanrui,et al.Node splitting algorithm of R/sup*-tree based on four-dimensional [J].Chinese Journal of Mechanical Engineering,2009,45(10):180-184.
SUN Dianzhu, LI Yanrui, ZHU Changzhi,et al.Node splitting algorithm for R/sup*-tree based on united expression of all geometry objects [J].Journal of Huazhong University of Science and Technology:Nature Science Edition,2010,38(2):55-58.
RAJASEKARAN S. On the Euclidean minimum spanning tree problem, Technical Report BECAT/CSE [R]. Storrs, CT, USA: Univ. of Connecticut,2004.