GIS中散乱点集凸包的快速算法及编程  

A Quick Algorithm and Programming to Determine Convex Hull for Planar Scattered Point Set in GIS

作　　者：李军辉[1] 李紫阳 

机构地区：[1]东南大学交通学院,南京210096 [2]沈阳军区某部司令部,沈阳110000

出　　处：《北京联合大学学报》2009年第3期32-34,43,共4页Journal of Beijing Union University

摘　　要：在地理信息系统(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.

关 键 词：GIS 凸包 算法 编程 

分 类 号：P208[天文地球—地图制图学与地理信息工程]