Given a set of points in 2 dimensions generate the Delaunay triangulation.
The input needs to be in the 2d points file format and the output needs to be in the Triangles format. Triangles can be in any order but the coordinates need to be in the same order in the output as in the input. The output can include additional points beyond the original points. These extra points must appear in the output after the original points and the resulting triangles must be a Delaunay triangulation of all points. The extra points can be used, for example, to insert points at the corners of a bounding box around the original points.
uniform -s -d 2 <n> <filename>
plummer -d 2 <n> <filename>
This project has been funded by the following sources:
Intel Labs Academic Research Office for the Parallel Algorithms for Non-Numeric Computing Program,
National Science Foundation, and
IBM Research.