摘要
在地理信息系统(GIS)中,不规则三角网(TIN)的生成及数字地面模型(DTM)的建立都会用到点集凸包的计算。通过研究了传统凸包算法,并对其进行改进,提出简单快速的点集凸包改进算法。经过验证,新算法可准确快速地求出点集凸包。
In GIS, the convex hull algorithms of a point set are always applied in the generation of TIN and the building of DTM. The paper discusses the traditional convex hull algorithms and puts forward a faster algorithm. It has been proved that the new algorithm can acquire convex hull quickly and accurately.
出处
《北京联合大学学报》
CAS
2009年第3期32-34,43,共4页
Journal of Beijing Union University
关键词
GIS
凸包
算法
编程
GIS
convex hull
algorithm
programming
