离散平面Voronoi图的光栅图形算法  

The Raster Graphic Algorithm of the Voronoi Diagram in Discrete Plane

作　　者：罗以宁[1] 王开平[1] 

机构地区：[1]四川大学计算机学院,成都610064

出　　处：《四川大学学报（自然科学版）》2003年第3期596-599,共4页Journal of Sichuan University(Natural Science Edition)

摘　　要：The data structure and the raster graphics algorithm for producing the Voronoi in discrete plane preseted. Delaunay triangulation can be realized on the basis of the data structure. The algorithm after simply expanded is feasible to the Voronoi diagram with binding conditions, such as with boundery and/or hole.The data structure and the raster graphics algorithm for producing the Voronoi in discrete plane preseted. Delaunay triangulation can be realized on the basis of the data structure. The algorithm after simply expanded is feasible to the Voronoi diagram with binding conditions, such as with boundery and/or hole.

关 键 词：计算机图形学 VORONOI图 光栅图形 生成算法 离散二维平面 数据结构 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]