Voronoi Diagrams 1Partially supported by the Deutsche Forschungsgemeinschaft, grant Kl 655 2-2.

GEOMPACK - Voronoi diagrams, Delaunay triangulations GEOMPACK is a set of routines for certain computational geometry problems. In particular, it can compute the Voronoi diagram, and the Delaunay triangulation, of a set of points in the plane.

CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 　　 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和

Title: Voronoi diagrams Descr iption: Exploration of several pixel-based voronoi diagram algorithms. Voronoi diagrams are used to divide space (in this case 2D space) amongst a collection of points.