| GIS中散乱点集凸包的快速算法及编程 |
| |
| 引用本文： | 李军辉,李紫阳.GIS中散乱点集凸包的快速算法及编程[J].北京联合大学学报(自然科学版),2009,23(3):32-34,43. |
| |
| 作者姓名： | 李军辉 李紫阳 |
| |
| 作者单位： | 1. 东南大学,交通学院,南京,210096
2. 沈阳军区某部司令部,沈阳,110000 |
| |
| 摘 要： | 在地理信息系统(GIS)中,不规则三角网(TIN)的生成及数字地面模型(DTM)的建立都会用到点集凸包的计算.通过研究了传统凸包算法,并对其进行改进,提出简单快速的点集凸包改进算法.经过验证,新算法可准确快速地求出点集凸包.
|
| 关 键 词： | 凸包 算法 编程 |
A Quick Algorithm and Programming to Determine Convex Hull for Planar Scattered Point Set in GIS |
| |
| LI Jun-hui,LI Zi-yang.A Quick Algorithm and Programming to Determine Convex Hull for Planar Scattered Point Set in GIS[J].Journal of Beijing Union University,2009,23(3):32-34,43. |
| |
| Authors: | LI Jun-hui LI Zi-yang |
| |
| Institution: | LI Jun-hui~1,LI Zi-yang~2(1.Transportation College,Southeast University,Nanjing 210096,China,2.Shenyang Military Region Comm,,Shenyang 110000,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | GIS |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
