摘要
Delaunay三角化在诸多应用领域都具有极其广泛的用途,也一直是GIS领域的重要研究内容。本文针对在Delaunay三角网建立中比较常用的分治算法即逐点插入法的缺点提出一些改进方案,在对逐点插入法改进的前提下提出将分治算法与逐点插入法相结合的综合算法。该综合算法既具有分治算法的高效率又具有逐点插入法的内存消耗小的优点,同时又较好地解决了分治算法与逐点插入法各自的缺点。
As one of the important research parts in GIS,delaunay triangulation has been widely applied in many fields.This paper introduces some improvements about incremental-insertion and data-set-partition,and proposes a compound algorithm based on incremental-insertion method and data-set-partition.The algorithm not only has high efficiency as incremental-insertion,but also takes up low EMS memory as data-set-partition.The proposed algorithm can also overcome some shortages of incremental-insertion and data-set-partition.
出处
《现代测绘》
2010年第4期14-16,共3页
Modern Surveying and Mapping
