balazon/ClosestPointLinearConstraints

Finds the closest point to a defined P point that fulfills linear constraints (inequalities, like 2x - 3y < 2.3), if there is such a point. The constraints, and the P point is all in 2D. This is a special case of the convex optimization problem called quadratic programming

C++