I could reduce the problem to the following list of points:
(344, 248)
(120, 248)
(184, 248)
(184, 181)
The problem here is that three points of adjacent triangles are on a line (y=248). This is a limitation of the Delaunay triangulation and stated in the documentation:
Note that the triangulation may meet problems at 4 co-circular points or at 3 or more collinear points.
This led to a removal of too many triangles in the cleanup step during
thor::triangulatePolygon() called from
thor::ConcaveShape, so that the convex shapes composing the concave shape were left empty.
I agree that this limitation is annoying, I'll investigate alternatives. For the concave shape it might suffice to simply offset points randomly by a tiny amount, but I actually prefer a clean solution that also works for other triangulations.