Triangulate a set of points with a concave domain

Question

Setup

Given some set of nodes within a convex hull, assume the domain contains one or more concave areas:

where blue dots are points, and the black li

Answer 1

You can try a constrained delaunay algorithm for example with sloan algoritm or cgal library.

[1] A Brute-Force Constrained Delaunay Triangulation?