/**
 * Voronoi diagram (2-D) — a consumer of the Delaunay triangulation.
 *
 * The Voronoi diagram is the dual of the Delaunay triangulation: each Delaunay
 * triangle contributes one Voronoi vertex (its circumcenter), and two Voronoi
 * vertices are joined by a ridge when their triangles share an edge. `voronoi`
 * returns the (unbounded) Voronoi vertices, the Delaunay triangle each one came
 * from, and the region (set of incident Voronoi vertices) of every generator.
 *
 * Pinned via implementation-independent invariants (Voronoi vertices are the
 * Delaunay circumcenters; each vertex's three generators are its nearest
 * generators — the dual empty-circumcircle property) in
 * `functions/tests/geometry-consumers-oracle.test.ts`.
 *
 * @packageDocumentation
 */
/** Structured Voronoi result (dual of the Delaunay triangulation). */
export interface VoronoiResult {
    /** Voronoi vertices — the circumcenters of the Delaunay triangles. */
    vertices: number[][];
    /**
     * The Delaunay triangle (triple of input-point indices) that produced each
     * Voronoi vertex, parallel to {@link VoronoiResult.vertices}.
     */
    simplices: number[][];
    /**
     * Per input point: the indices (into `vertices`) of the Voronoi vertices on
     * the boundary of that point's Voronoi cell (unordered). Bounded cells of
     * interior points are closed; unbounded cells of hull points are open.
     */
    regions: number[][];
}
/**
 * Voronoi diagram of a set of 2-D points (the dual of {@link delaunay}).
 *
 * @param points - Array of `[x, y]` points (at least 3, not all collinear).
 * @returns A {@link VoronoiResult}.
 * @throws When given fewer than 3 points or a non-2-D point set.
 *
 * @example
 * voronoi([[0,0],[1,0],[0,1],[1,1],[0.5,0.5]]).vertices.length // == triangle count
 */
export declare function voronoi(points: number[][]): VoronoiResult;
//# sourceMappingURL=voronoi.d.ts.map