|
bool | inHull (poly p, poly pointPoly, int m, int site) |
| Returns true iff the support of poly pointPoly is inside the convex hull of all points given by the support of poly p. More...
|
|
Definition at line 251 of file mpr_base.cc.
◆ convexHull()
convexHull::convexHull |
( |
simplex * |
_pLP | ) |
|
|
inline |
◆ ~convexHull()
convexHull::~convexHull |
( |
| ) |
|
|
inline |
◆ inHull()
bool convexHull::inHull |
( |
poly |
p, |
|
|
poly |
pointPoly, |
|
|
int |
m, |
|
|
int |
site |
|
) |
| |
|
private |
Returns true iff the support of poly pointPoly is inside the convex hull of all points given by the support of poly p.
Definition at line 732 of file mpr_base.cc.
750 for(
i= 1;
i <=
n;
i++) {
753 for(
j= 1;
j <=
m;
j++ )
764 PrintS(
"Matrix of Linear Programming\n");
◆ newtonPolytopesI()
ideal convexHull::newtonPolytopesI |
( |
const ideal |
gls | ) |
|
Definition at line 836 of file mpr_base.cc.
846 vert= (
int *)
omAlloc( (idelem+1) *
sizeof(int) );
849 for(
i= 0;
i < idelem;
i++ )
854 for(
j= 1;
j <=
m;
j++) {
857 if ( (id->m)[
i] ==
NULL )
879 omFreeSize( (
void *) vert, (idelem+1) *
sizeof(
int) );
883 for(
i= 0;
i < idelem;
i++ )
◆ newtonPolytopesP()
Computes the point sets of the convex hulls of the supports given by the polynoms in gls.
Returns Q[].
Definition at line 778 of file mpr_base.cc.
786 vert= (
int *)
omAlloc( (idelem+1) *
sizeof(int) );
789 for (
i= 0;
i < idelem;
i++ )
792 for(
i= 0;
i < idelem;
i++ )
798 for(
j= 1;
j <=
m;
j++) {
815 omFreeSize( (
void *) vert, (idelem+1) *
sizeof(
int) );
819 for(
i= 0;
i < idelem;
i++ )
◆ pLP
The documentation for this class was generated from the following file:
bool inHull(poly p, poly pointPoly, int m, int site)
Returns true iff the support of poly pointPoly is inside the convex hull of all points given by the s...
bool addPoint(const onePointP vert)
Adds a point to pointSet, copy vert[0,...,dim] ot point[num+1][0,...,dim].