convexHull Class Reference

Public Member Functions
	convexHull (simplex *_pLP)
	~convexHull ()
pointSet **	newtonPolytopesP (const ideal gls)
	Computes the point sets of the convex hulls of the supports given by the polynoms in gls.
ideal	newtonPolytopesI (const ideal gls)

Private Member Functions
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.

Private Attributes
pointSet **	Q
int	n
simplex *	pLP

Detailed Description

Definition at line 249 of file mpr_base.cc.

Constructor & Destructor Documentation

convexHull()

convexHull::convexHull ( simplex * _pLP )

inline

Definition at line 252 of file mpr_base.cc.

: pLP(_pLP) {}

~convexHull()

convexHull::~convexHull ( )

inline

Definition at line 253 of file mpr_base.cc.

{}

Member Function Documentation

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.

{
  int i, j, col;
 
  pLP->m = n+1;
  pLP->n = m;                // this includes col of cts
 
  pLP->LiPM[1][1] = +0.0;
  pLP->LiPM[1][2] = +1.0;        // optimize (arbitrary) var
  pLP->LiPM[2][1] = +1.0;
  pLP->LiPM[2][2] = -1.0;         // lambda vars sum up to 1
 
  for ( j=3; j <= pLP->n; j++)
  {
    pLP->LiPM[1][j] = +0.0;
    pLP->LiPM[2][j] = -1.0;
  }
 
  for( i= 1; i <= n; i++) {        // each row constraints one coor
    pLP->LiPM[i+2][1] = (mprfloat)pGetExp(pointPoly,i);
    col = 2;
    for( j= 1; j <= m; j++ )
    {
      if( j != site )
      {
        pLP->LiPM[i+2][col] = -(mprfloat)pGetExp( monomAt(p,j), i );
        col++;
      }
    }
  }
 
#ifdef mprDEBUG_ALL
  PrintS("Matrix of Linear Programming\n");
  print_mat( pLP->LiPM, pLP->m+1,pLP->n);
#endif
 
  pLP->m3= pLP->m;
 
  pLP->compute();
 
  return (pLP->icase == 0);
}

newtonPolytopesI()

ideal convexHull::newtonPolytopesI

(

const ideal

gls

)

Definition at line 834 of file mpr_base.cc.

{
  int i, j;
  int m;  // Anzahl der Exponentvektoren im i-ten Polynom (gls->m)[i] des Ideals gls
  int idelem= IDELEMS(gls);
  ideal id;
  poly p,pid=NULL;
  int * vert;
 
  n= (currRing->N);
  vert= (int *)omAlloc( (idelem+1) * sizeof(int) );
  id= idInit( idelem, 1 );
 
  for( i= 0; i < idelem; i++ )
  {
    m = pLength( (gls->m)[i] );
 
    p= (gls->m)[i];
    for( j= 1; j <= m; j++) {  // fuer jeden Exponentvektor
      if( !inHull( (gls->m)[i], p, m, j ) )
      {
        if ( (id->m)[i] == NULL )
        {
          (id->m)[i]= pHead(p);
          pid=(id->m)[i];
        }
        else
        {
          pNext(pid)= pHead(p);
          pIter(pid);
          //pNext(pid)= NULL;// done by pHead
        }
        mprSTICKYPROT(ST_SPARSE_VADD);
      }
      else
      {
        mprSTICKYPROT(ST_SPARSE_VREJ);
      }
      pIter( p );
    } // j
    mprSTICKYPROT("\n");
  } // i
 
  omFreeSize( (void *) vert, (idelem+1) * sizeof(int) );
 
#ifdef mprDEBUG_PROT
  PrintLn();
  for( i= 0; i < idelem; i++ )
  {
  }
#endif
 
  return id;
}

newtonPolytopesP()

pointSet ** convexHull::newtonPolytopesP

(

const ideal

gls

)

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.

{
  int i, j, k;
  int m;  // Anzahl der Exponentvektoren im i-ten Polynom (gls->m)[i] des Ideals gls
  int idelem= IDELEMS(gls);
  int * vert;
 
  n= (currRing->N);
  vert= (int *)omAlloc( (idelem+1) * sizeof(int) );
 
  Q = (pointSet **)omAlloc( idelem * sizeof(pointSet*) );        // support hulls
  for ( i= 0; i < idelem; i++ )
    Q[i] = new pointSet( (currRing->N), i+1, pLength((gls->m)[i])+1 );
 
  for( i= 0; i < idelem; i++ )
  {
    k=1;
    m = pLength( (gls->m)[i] );
 
    poly p= (gls->m)[i];
    for( j= 1; j <= m; j++) {  // fuer jeden Exponentvektor
      if( !inHull( (gls->m)[i], p, m, j ) )
      {
        p_GetExpV( p, vert, currRing );
        Q[i]->addPoint( vert );
        k++;
        mprSTICKYPROT(ST_SPARSE_VADD);
      }
      else
      {
        mprSTICKYPROT(ST_SPARSE_VREJ);
      }
      pIter( p );
    } // j
    mprSTICKYPROT("\n");
  } // i
 
  omFreeSize( (void *) vert, (idelem+1) * sizeof(int) );
 
#ifdef mprDEBUG_PROT
  PrintLn();
  for( i= 0; i < idelem; i++ )
  {
    Print(" \\Conv(Qi[%d]): #%d\n", i,Q[i]->num );
    for ( j=1; j <= Q[i]->num; j++ )
    {
      Print("%d: <",j);print_exp( (*Q[i])[j] , (currRing->N) );PrintS(">\n");
    }
    PrintLn();
  }
#endif
 
  return Q;
}

Field Documentation

n

int convexHull::n

private

Definition at line 270 of file mpr_base.cc.

pLP

simplex* convexHull::pLP

private

Definition at line 271 of file mpr_base.cc.

Q

pointSet** convexHull::Q

private

Definition at line 269 of file mpr_base.cc.

---

The documentation for this class was generated from the following file:

• kernel/numeric/mpr_base.cc