间接法生成Voronoi图的设计与实现  

Design and Implementation of an Indirect Way to Build Voronoi Diagram

作　　者：谢文全[1] 田琳[2] 施新程[1] 张兴国[1] 

机构地区：[1]信阳师范学院城市与环境科学学院,河南信阳464000 [2]南阳医学高等专科学校,河南南阳473058

出　　处：《信阳师范学院学报（自然科学版）》2009年第4期621-623,共3页Journal of Xinyang Normal University(Natural Science Edition)

基　　金：河南省自然科学基金项目(0411033400)

摘　　要：设计出存储有点、线、面、Voronoi多边形等对象拓扑关系的数据结构,通过边扩展算法先构成Delaunay三角网.在此基础上引入凸包生成算法,生成Voronoi图,Voronoi图是GIS空间分析中一个重要的工具.A kind of data structure that can be used to record the topology between different objects such as point, line, triangle and Voronoi polygon is presented. Delaunay triangulation is built, and then the algorithm of building convex hull is imported to build the Voronoi diagram. Voronoi diagram is an important spatial analysis tool in the field of GIS

关 键 词：VORONOI图 DELAUNAY三角形 凸包 

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