Given a Delaunay triangulation in 2 dimensions, return a Delaunay triangulation that includes all original points plus additional points such that no triangle has an angle smaller than a threshold Theta.
Both the input and output need to be in the Triangles file format. The input must be a valid Delaunay triangulation of its points. The output must include all input points, plus any number of additional points, and must be a valid Delaunay Triangulation of all its points.
uniform -s -d 2 <n> <tmpname>
delaunay -o <filename> <tmpname>
plummer -d 2 <n> <tmpname>
delaunay -o <filename> <tmpname>
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.