![]() |
My Project
debian-1:4.1.1-p2+ds-4build2
|
Public Member Functions | |
mayanPyramidAlg (simplex *_pLP) | |
~mayanPyramidAlg () | |
pointSet * | getInnerPoints (pointSet **_q_i, mprfloat _shift[]) |
Drive Mayan Pyramid Algorithm. More... | |
Private Member Functions | |
void | runMayanPyramid (int dim) |
Recursive Mayan Pyramid algorithm for directly computing MinkowskiSum lattice points for (n+1)-fold MinkowskiSum of given point sets Qi[]. More... | |
mprfloat | vDistance (Coord_t *acoords, int dim) |
Compute v-distance via Linear Programing Linear Program finds the v-distance of the point in accords[]. More... | |
void | mn_mx_MinkowskiSum (int dim, Coord_t *minR, Coord_t *maxR) |
LP for finding min/max coord in MinkowskiSum, given previous coors. More... | |
bool | storeMinkowskiSumPoint () |
Stores point in E->points[pt], iff v-distance != 0 Returns true iff point was stored, else flase. More... | |
Private Attributes | |
pointSet ** | Qi |
pointSet * | E |
mprfloat * | shift |
int | n |
int | idelem |
Coord_t | acoords [MAXVARS+2] |
simplex * | pLP |
Definition at line 279 of file mpr_base.cc.
|
inline |
Definition at line 282 of file mpr_base.cc.
|
inline |
Definition at line 283 of file mpr_base.cc.
Drive Mayan Pyramid Algorithm.
The Alg computes conv(Qi[]+shift[]).
Definition at line 893 of file mpr_base.cc.
LP for finding min/max coord in MinkowskiSum, given previous coors.
Assume MinkowskiSum in non-negative quadrants coor in [0,n); fixed coords in acoords[0..coor)
Definition at line 998 of file mpr_base.cc.
|
private |
Recursive Mayan Pyramid algorithm for directly computing MinkowskiSum lattice points for (n+1)-fold MinkowskiSum of given point sets Qi[].
Recursively for range of dim: dim in [0..n); acoords[0..var) fixed. Stores only MinkowskiSum points of udist > 0: done by storeMinkowskiSumPoints.
Definition at line 1164 of file mpr_base.cc.
|
private |
Stores point in E->points[pt], iff v-distance != 0 Returns true iff point was stored, else flase.
Definition at line 1140 of file mpr_base.cc.
Compute v-distance via Linear Programing Linear Program finds the v-distance of the point in accords[].
The v-distance is the distance along the direction v to boundary of Minkowski Sum of Qi (here vector v is represented by shift[]). Returns the v-distance or -1.0 if an error occurred.
Definition at line 911 of file mpr_base.cc.
Definition at line 325 of file mpr_base.cc.
|
private |
Definition at line 320 of file mpr_base.cc.
|
private |
Definition at line 323 of file mpr_base.cc.
|
private |
Definition at line 323 of file mpr_base.cc.
|
private |
Definition at line 327 of file mpr_base.cc.
|
private |
Definition at line 319 of file mpr_base.cc.
|
private |
Definition at line 321 of file mpr_base.cc.