基于四叉树的多边形处理技术研究  

Study of Processing Technique for Polygon Based on Quadtree

作　　者：唐立文[1] 宇文静波[1] 叶建设[1] 

机构地区：[1]装备指挥技术学院,北京101416

出　　处：《系统仿真学报》2008年第S1期191-194,共4页Journal of System Simulation

摘　　要：由于数据获取、表示、组织以及处理等方面的原因,相邻空间矢量数据会出现缝隙。针对多边形矢量数据,基于全球四叉树索引机制,首先将多边形分割存储到不同的四叉树节点,然后采用搜索两相邻四叉树节点内待拼接多边形交点集合的方法,实现多边形的拼接。结果表明,研究的多边形处理算法,可以很好实现空间多边形的分布存储,完整表现。Because of the data obtainment、expression、organization and processing,cracks occured in the adjacent spatial vectors.Thus,based on the efficient index of global quadtree,the polygons were divided and saved according to the different quadtree nodes firstly,and then were jointed by searching the polygon's intersection points between two adjoining quadtree nodes.The results show that the algorithm can carry out the distributed storage and integrated entity on polygons.

关 键 词：空间矢量数据 全球四叉树 多边形 分割 拼接 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]