|
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 249 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 730 of file mpr_base.cc.
748 for(
i= 1;
i <=
n;
i++) {
751 for(
j= 1;
j <=
m;
j++ )
762 PrintS(
"Matrix of Linear Programming\n");
◆ newtonPolytopesI()
ideal convexHull::newtonPolytopesI |
( |
const ideal |
gls | ) |
|
Definition at line 834 of file mpr_base.cc.
844 vert= (
int *)
omAlloc( (idelem+1) *
sizeof(int) );
847 for(
i= 0;
i < idelem;
i++ )
852 for(
j= 1;
j <=
m;
j++) {
855 if ( (id->m)[
i] ==
NULL )
877 omFreeSize( (
void *) vert, (idelem+1) *
sizeof(
int) );
881 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 776 of file mpr_base.cc.
784 vert= (
int *)
omAlloc( (idelem+1) *
sizeof(int) );
787 for (
i= 0;
i < idelem;
i++ )
790 for(
i= 0;
i < idelem;
i++ )
796 for(
j= 1;
j <=
m;
j++) {
813 omFreeSize( (
void *) vert, (idelem+1) *
sizeof(
int) );
817 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].