Node-d3-delaunay is a fast library for computing the Voronoi diagram of a set of two-dimensional points. It is based on included node-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.