摘要
通过对Voronoi图的定义和组成的分析,对其主要构成几何元封装成相应的C++类,用逐点插入算法实现其构造。针对算法中若干具体细节提出了许多新颖的处理方法,如循环查找待处理单元算法和插入剔除算法等,并给出退化情况的处理。
Through the analysis of the definition and composition of the voronoi diagram, the primitive objects are encapsulated in C＋ ＋ classes. Construction is done by insertion algorithm point by point. Many new processing methods are proposed（ circularly finding the cell to be dealt,inserting then deleting, etc ） to solve the detailed problems. General situation is discussed, and the solution is given.
出处
《计算机应用与软件》
CSCD
北大核心
2008年第11期220-222,共3页
Computer Applications and Software
