A class for triangulating a set of points to satisfy the Delaunay property (subject to the given linear constraints).
A class for triangulating a set of points to satisfy the Delaunay property (subject to the given linear constraints). Each resulting triangle's circumscribing circle will contain no other points of the input set.
A class for triangulating a set of points to satisfy the delaunay property.
A class for triangulating a set of points to satisfy the delaunay property. Each resulting triangle's circumscribing circle will contain no other points of the input set.
A class to compute the Voronoi diagram of a collection of points.
A class to compute the Voronoi diagram of a collection of points. The Voronoi diagram partitions the plane into a set of non-overlapping convex polygonal cells in one-to-one correspondence with the input points. The cells are defined as the region in the plane closer to the corresponding point than any other point.
This class is a simple wrapper around functionality provided by JTS. That package elected to compute the Voronoi cells bounded by an arbitrary bounding triangle. While this bounding triangle is large, it is not infinite nor user-specifiable. If the target point set inhabits a region that is small with respect to the domain of interest, you may have to handle cell boundaries.