海量平面点集Voronoi图的构造算法

Constructional algorithm for Voronoi diagram of massive planar point sets

进一步发展平面点集Voronoi图的增量式外置算法.在对"海量"点组成的平面点集进行Voronoi划分时,设计"硬盘数据文件——内存结构体数组"之间动态的数据交互方案,避开计算机内存的限制,有效实现了数十万Voronoi晶胞集合体的构造,存储Voronoi图几何信息的数据最后以文本文件的形式输出,方便Voronoi图在工程实际中的应用与二次开发.

External incremental algorithm for Voronoi diagram of massive planar point sets was further developed. During the Voronoi tessellation on a planar point set composed of massive points, a technical scheme of dynamic data-exchange between hard disk data file and internal memory structural array designed so, that the limitation of computer internal memory storage need not be considered and the construction of massive Voronoi cells as many as hundreds thousant in number was effectively implemented. The data that store information of Voronoi cells could be outputted in the format of text file. This made it greatly convenient to apply the Voronoi cells to engineering applications and secondary exploitation.