Given a set of points A that have to be inside the hull, and a set of points B that have to be outside. It is clear that set A can be enclosed with a convex hull algorithm, but how can set B be excluded?
I am looking for a polygon that encloses A \ B on a 3D surface triangle mesh.
Edit:
Thanks @Magma for helping me clarify the problem with an additional property: The hull should have maximal area while having only vertices in A.
