How to cut triangles from concave Delaunay triangulation?

Question

I use Delaunay to triangulate a concave polygon, but it fills the concavities. How to automatically delete triangles that are outside the boundaries of the polygon?

Answer 1

Auto answer: in some cases this is not possible. I needed to use the limited Delaunay algorithm: http://www.cs.cmu.edu/~quake/triangle.delaunay.html

Answer 2

You shouldn't, you should find a Delauney procedure that handles borders correctly.

Alternatively, you could, assuming you know the edges, go through each triangle and remove the ones that cross the edge. Find percent segment tests for code to do this.