d3-delaunay
这是一个用于计算二维点集的Voronoi 图的快速库。它基于Delaunator，这是一个使用扫描算法计算Delaunay 三角化的快速库。Voronoi 图是通过连接 Delaunay 三角化中相邻三角形的外心构建的。
🌐 This is a fast library for computing the Voronoi diagram of a set of two-dimensional points. It is based on Delaunator, a fast library for computing the Delaunay triangulation using sweep algorithms. The Voronoi diagram is constructed by connecting the circumcenters of adjacent triangles in the Delaunay triangulation.
请参阅以下之一：
🌐 See one of:
有关此库如何工作的互动讲解，请参见 德劳内的对偶。
🌐 For an interactive explanation of how this library works, see The Delaunay’s Dual.