KrisLibrary
1.0.0
|
A method for projecting a polytope defined by the feasible set of a linear program lp onto a 2D subspace. Handles unbounded and infeasible problems. More...
#include <PolytopeProjection.h>
Public Types | |
typedef std::list< Geometry::PointRay2D >::iterator | PointIterator |
Public Member Functions | |
PolytopeProjection2D (Optimization::LinearProgram &lp, int varx=0, int vary=1) | |
PolytopeProjection2D (Optimization::LinearProgram_Sparse &lps, int varx=0, int vary=1) | |
void | Solve (UnboundedPolytope2D &poly) |
Solves for the polytope. Equivalent to Expand(), Create(). | |
void | Expand () |
Expand the entire polytope. | |
void | Create (UnboundedPolytope2D &poly) const |
Creates the polytope structures. | |
void | ExpandEdge (PointIterator i, int depth=0) |
Helper: expand the edge coming out of i (whose source is i) | |
Public Attributes | |
LPSolvePointCallback | f |
std::list< Geometry::PointRay2D > | points |
int | maxDepth |
A method for projecting a polytope defined by the feasible set of a linear program lp onto a 2D subspace. Handles unbounded and infeasible problems.
Typical calling convention is UnboundedPolytope2D poly; PolytopeProjection2D proj(lp); proj.Create(poly);