I need to convert a triangulation to a set of convex polygons. A good result would have a large average polygon size and a small average deviation from the average polygon size. Is anyone aware of papers/articles/algorithms to do this?
A related question, given the criteria mentioned above, should I expect better results when using a constrained delaunay triangulation vs a mere constrained triangulation as input?
