DelaunayVoronoiResult

For each entry in Vertices, the indices of the vertices connected to it by a Delaunay edge, sorted ascending.

The clip box that was used for the Voronoi cells.

The unique edges of the Delaunay tetrahedralization (each vertex pair once), with endpoints from Vertices.

The vertex index pair (I < J) of each unique Delaunay edge. Index-aligned with DelaunayEdges when both are requested: DelaunayEdges[k] connects Vertices[DelaunayEdgeTopology[k].I] to Vertices[DelaunayEdgeTopology[k].J].

One closed triangle mesh per finite Delaunay tetrahedron, aligned with Tets (requires the DelaunayMeshes output flag; Tets alignment holds whenever both are requested).

Maps each input point index to its index in Vertices.

The finite Delaunay tetrahedra with adjacency.

The merged (deduplicated) vertex set actually triangulated.

One entry per INPUT point, in input order. Each mesh is the closed, box-clipped Voronoi cell of that point (with ngon faces). Entries are null for duplicate points (the cell is attached to the first occurrence) and for points whose cell is empty (site outside the clip box).

The unique edges of the box-clipped Voronoi diagram (each edge once, shared endpoints welded so adjacent cells reference identical coordinates). Includes the edges cut into the clip box faces.