Returns a mutable reference to the associated data of a vertex.

An iterator visiting all vertices. The iterator type is [VertexHandle]

An iterator visiting all faces of the Voronoi diagram. The iterator type is [VoronoiFace]

Creates a new triangulation and pre-allocates some space for vertices, edges and faces

Specifies a lower bound for a triangles area. The algorithm will attempt to ignore any triangle with an area below this limit. This can also prevent