No. In fact, that is essentially impossible to solve, since a set of constraints will always be anded together. And if your constraints are linear, then any set of linear constraints with an and between them MUST ALWAYS represent a convex set. (Though it may be unbounded.)
You can use tools like an alpha shape to find a triangulation/tessellation for the set of vertices. But you cannot then convert that tessellation into a set of linear constraints. Sorry, but that is as far as you can go.
