/opt/ros/diamondback/stacks/graspit_simulator/graspit/graspit_source/qhull/poly.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  hashentryT

Defines

#define FORALLfacet_(facetlist)   if ( facetlist ) for( facet=( facetlist );facet && facet->next;facet=facet->next )
#define FORALLnew_facets   for( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfacet->next )
#define FORALLsame_(newfacet)   for (same= newfacet->f.samecycle; same != newfacet; same= same->f.samecycle)
#define FORALLsame_cycle_(newfacet)
#define FORALLvertex_(vertexlist)   for ( vertex=( vertexlist );vertex && vertex->next;vertex= vertex->next )
#define FORALLvisible_facets   for (visible=qh visible_list; visible && visible->visible; visible= visible->next)
#define FOREACHentry_(entries)   FOREACHsetelement_(hashentryT, entries, entry)
#define FOREACHneighborA_(facet)   FOREACHsetelement_(facetT, facet->neighbors, neighborA)
#define FOREACHnewfacet_(facets)   FOREACHsetelement_(facetT, facets, newfacet)
#define FOREACHvertexA_(vertices)   FOREACHsetelement_(vertexT, vertices, vertexA)
#define FOREACHvertexreverse12_(vertices)   FOREACHsetelementreverse12_(vertexT, vertices, vertex)
#define FOREACHvisible_(facets)   FOREACHsetelement_(facetT, facets, visible)
#define qh_ALGORITHMfault   0
#define qh_DATAfault   1
#define qh_DUPLICATEridge   ( facetT * ) 1L
#define qh_MERGEridge   ( facetT * ) 2L

Typedefs

typedef struct hashentryT hashentryT

Functions

void qh_addhash (void *newelem, setT *hashtable, int hashsize, unsigned hash)
void qh_appendfacet (facetT *facet)
void qh_appendvertex (vertexT *vertex)
void qh_attachnewfacets (void)
void qh_check_bestdist (void)
void qh_check_maxout (void)
void qh_check_output (void)
void qh_check_point (pointT *point, facetT *facet, realT *maxoutside, realT *maxdist, facetT **errfacet1, facetT **errfacet2)
void qh_check_points (void)
void qh_checkconvex (facetT *facetlist, int fault)
void qh_checkfacet (facetT *facet, boolT newmerge, boolT *waserrorp)
boolT qh_checkflipped (facetT *facet, realT *dist, boolT allerror)
void qh_checkflipped_all (facetT *facetlist)
void qh_checkpolygon (facetT *facetlist)
void qh_checkvertex (vertexT *vertex)
void qh_clearcenters (qh_CENTER type)
void qh_createsimplex (setT *vertices)
void qh_deletevisible (void)
void qh_delfacet (facetT *facet)
void qh_delridge (ridgeT *ridge)
void qh_delvertex (vertexT *vertex)
setT * qh_facet3vertex (facetT *facet)
setT * qh_facetintersect (facetT *facetA, facetT *facetB, int *skipAp, int *skipBp, int extra)
facetT * qh_findbestfacet (pointT *point, boolT bestoutside, realT *bestdist, boolT *isoutside)
facetT * qh_findfacet_all (pointT *point, realT *bestdist, boolT *isoutside, int *numpart)
int qh_findgood (facetT *facetlist, int goodhorizon)
void qh_findgood_all (facetT *facetlist)
void qh_furthestnext (void)
void qh_furthestout (facetT *facet)
unsigned qh_gethash (int hashsize, setT *set, int size, int firstindex, void *skipelem)
void qh_infiniteloop (facetT *facet)
void qh_initbuild (void)
void qh_initialhull (setT *vertices)
setT * qh_initialvertices (int dim, setT *maxpoints, pointT *points, int numpoints)
vertexT * qh_isvertex (pointT *point, setT *vertices)
facetT * qh_makenew_nonsimplicial (facetT *visible, vertexT *apex, int *numnew)
facetT * qh_makenew_simplicial (facetT *visible, vertexT *apex, int *numnew)
facetT * qh_makenewfacet (setT *vertices, boolT toporient, facetT *facet)
vertexT * qh_makenewfacets (pointT *point)
void qh_makenewplanes (void)
void qh_matchduplicates (facetT *atfacet, int atskip, int hashsize, int *hashcount)
void qh_matchneighbor (facetT *newfacet, int newskip, int hashsize, int *hashcount)
void qh_matchnewfacets (void)
boolT qh_matchvertices (int firstindex, setT *verticesA, int skipA, setT *verticesB, int *skipB, boolT *same)
void qh_nearcoplanar (void)
vertexT * qh_nearvertex (facetT *facet, pointT *point, realT *bestdistp)
facetT * qh_newfacet (void)
int qh_newhashtable (int newsize)
ridgeT * qh_newridge (void)
vertexT * qh_newvertex (pointT *point)
ridgeT * qh_nextridge3d (ridgeT *atridge, facetT *facet, vertexT **vertexp)
void qh_outcoplanar (void)
pointT * qh_point (int id)
void qh_point_add (setT *set, pointT *point, void *elem)
setT * qh_pointfacet (void)
int qh_pointid (pointT *point)
setT * qh_pointvertex (void)
void qh_prependfacet (facetT *facet, facetT **facetlist)
void qh_printhashtable (FILE *fp)
void qh_printlists (void)
void qh_removefacet (facetT *facet)
void qh_removevertex (vertexT *vertex)
void qh_resetlists (boolT stats)
void qh_setvoronoi_all (void)
void qh_updatevertices (void)
void qh_vertexintersect (setT **vertexsetA, setT *vertexsetB)
setT * qh_vertexintersect_new (setT *vertexsetA, setT *vertexsetB)
void qh_vertexneighbors (void)
boolT qh_vertexsubset (setT *vertexsetA, setT *vertexsetB)

Define Documentation

#define FORALLfacet_ ( facetlist   )     if ( facetlist ) for( facet=( facetlist );facet && facet->next;facet=facet->next )

Definition at line 87 of file poly.h.

#define FORALLnew_facets   for( newfacet=qh newfacet_list;newfacet && newfacet->next;newfacet=newfacet->next )

Definition at line 99 of file poly.h.

#define FORALLsame_ ( newfacet   )     for (same= newfacet->f.samecycle; same != newfacet; same= same->f.samecycle)

Definition at line 135 of file poly.h.

#define FORALLsame_cycle_ ( newfacet   ) 
Value:
for (same= newfacet->f.samecycle; \
         same; same= (same == newfacet ?  NULL : same->f.samecycle))

Definition at line 147 of file poly.h.

#define FORALLvertex_ ( vertexlist   )     for ( vertex=( vertexlist );vertex && vertex->next;vertex= vertex->next )

Definition at line 111 of file poly.h.

#define FORALLvisible_facets   for (visible=qh visible_list; visible && visible->visible; visible= visible->next)

Definition at line 123 of file poly.h.

#define FOREACHentry_ ( entries   )     FOREACHsetelement_(hashentryT, entries, entry)

Definition at line 161 of file poly.h.

#define FOREACHneighborA_ ( facet   )     FOREACHsetelement_(facetT, facet->neighbors, neighborA)

Definition at line 178 of file poly.h.

#define FOREACHnewfacet_ ( facets   )     FOREACHsetelement_(facetT, facets, newfacet)

Definition at line 202 of file poly.h.

#define FOREACHvertexA_ ( vertices   )     FOREACHsetelement_(vertexT, vertices, vertexA)

Definition at line 214 of file poly.h.

#define FOREACHvertexreverse12_ ( vertices   )     FOREACHsetelementreverse12_(vertexT, vertices, vertex)

Definition at line 227 of file poly.h.

#define FOREACHvisible_ ( facets   )     FOREACHsetelement_(facetT, facets, visible)

Definition at line 190 of file poly.h.

#define qh_ALGORITHMfault   0

Definition at line 23 of file poly.h.

#define qh_DATAfault   1

Definition at line 31 of file poly.h.

#define qh_DUPLICATEridge   ( facetT * ) 1L

Definition at line 42 of file poly.h.

#define qh_MERGEridge   ( facetT * ) 2L

Definition at line 53 of file poly.h.

Typedef Documentation

typedef struct hashentryT hashentryT

Definition at line 64 of file poly.h.

Function Documentation

void qh_addhash ( void *  newelem,
setT *  hashtable,
int  hashsize,
unsigned  hash 
)

Definition at line 28 of file poly2.c.

void qh_appendfacet ( facetT *  facet  ) 

Definition at line 37 of file poly.c.

void qh_appendvertex ( vertexT *  vertex  ) 

Definition at line 71 of file poly.c.

void qh_attachnewfacets ( void   ) 

Definition at line 128 of file poly.c.

void qh_check_bestdist ( void   ) 

Definition at line 66 of file poly2.c.

void qh_check_maxout ( void   ) 

Definition at line 165 of file poly2.c.

void qh_check_output ( void   ) 

Definition at line 240 of file poly2.c.

void qh_check_point ( pointT *  point,
facetT *  facet,
realT *  maxoutside,
realT *  maxdist,
facetT **  errfacet1,
facetT **  errfacet2 
)

Definition at line 263 of file poly2.c.

void qh_check_points ( void   ) 

Definition at line 300 of file poly2.c.

void qh_checkconvex ( facetT *  facetlist,
int  fault 
)

Definition at line 406 of file poly2.c.

void qh_checkfacet ( facetT *  facet,
boolT  newmerge,
boolT *  waserrorp 
)

Definition at line 552 of file poly2.c.

boolT qh_checkflipped ( facetT *  facet,
realT *  dist,
boolT  allerror 
)

Definition at line 217 of file poly.c.

void qh_checkflipped_all ( facetT *  facetlist  ) 

Definition at line 755 of file poly2.c.

void qh_checkpolygon ( facetT *  facetlist  ) 

Definition at line 802 of file poly2.c.

void qh_checkvertex ( vertexT *  vertex  ) 

Definition at line 919 of file poly2.c.

void qh_clearcenters ( qh_CENTER  type  ) 

Definition at line 958 of file poly2.c.

void qh_createsimplex ( setT *  vertices  ) 

Definition at line 998 of file poly2.c.

void qh_deletevisible ( void   ) 

Definition at line 289 of file poly.c.

void qh_delfacet ( facetT *  facet  ) 

Definition at line 246 of file poly.c.

void qh_delridge ( ridgeT *  ridge  ) 

Definition at line 1042 of file poly2.c.

void qh_delvertex ( vertexT *  vertex  ) 

Definition at line 1062 of file poly2.c.

setT* qh_facet3vertex ( facetT *  facet  ) 

Definition at line 1085 of file poly2.c.

setT* qh_facetintersect ( facetT *  facetA,
facetT *  facetB,
int *  skipAp,
int *  skipBp,
int  extra 
)

Definition at line 340 of file poly.c.

facetT* qh_findbestfacet ( pointT *  point,
boolT  bestoutside,
realT *  bestdist,
boolT *  isoutside 
)

Definition at line 1150 of file poly2.c.

facetT* qh_findfacet_all ( pointT *  point,
realT *  bestdist,
boolT *  isoutside,
int *  numpart 
)

Definition at line 1196 of file poly2.c.

int qh_findgood ( facetT *  facetlist,
int  goodhorizon 
)

Definition at line 1256 of file poly2.c.

void qh_findgood_all ( facetT *  facetlist  ) 

Definition at line 1356 of file poly2.c.

void qh_furthestnext ( void   ) 

Definition at line 1419 of file poly2.c.

void qh_furthestout ( facetT *  facet  ) 

Definition at line 1462 of file poly2.c.

unsigned qh_gethash ( int  hashsize,
setT *  set,
int  size,
int  firstindex,
void *  skipelem 
)

Definition at line 401 of file poly.c.

void qh_infiniteloop ( facetT *  facet  ) 

Definition at line 1493 of file poly2.c.

void qh_initbuild ( void   ) 

Definition at line 1524 of file poly2.c.

void qh_initialhull ( setT *  vertices  ) 

Definition at line 1624 of file poly2.c.

setT* qh_initialvertices ( int  dim,
setT *  maxpoints,
pointT *  points,
int  numpoints 
)

Definition at line 1713 of file poly2.c.

vertexT* qh_isvertex ( pointT *  point,
setT *  vertices 
)

Definition at line 1793 of file poly2.c.

facetT* qh_makenew_nonsimplicial ( facetT *  visible,
vertexT *  apex,
int *  numnew 
)

Definition at line 543 of file poly.c.

facetT* qh_makenew_simplicial ( facetT *  visible,
vertexT *  apex,
int *  numnew 
)

Definition at line 640 of file poly.c.

facetT* qh_makenewfacet ( setT *  vertices,
boolT  toporient,
facetT *  facet 
)

Definition at line 461 of file poly.c.

vertexT* qh_makenewfacets ( pointT *  point  ) 

Definition at line 1829 of file poly2.c.

void qh_makenewplanes ( void   ) 

Definition at line 494 of file poly.c.

void qh_matchduplicates ( facetT *  atfacet,
int  atskip,
int  hashsize,
int *  hashcount 
)

Definition at line 1893 of file poly2.c.

void qh_matchneighbor ( facetT *  newfacet,
int  newskip,
int  hashsize,
int *  hashcount 
)

Definition at line 704 of file poly.c.

void qh_matchnewfacets ( void   ) 

Definition at line 816 of file poly.c.

boolT qh_matchvertices ( int  firstindex,
setT *  verticesA,
int  skipA,
setT *  verticesB,
int *  skipB,
boolT *  same 
)

Definition at line 925 of file poly.c.

void qh_nearcoplanar ( void   ) 

Definition at line 2000 of file poly2.c.

vertexT* qh_nearvertex ( facetT *  facet,
pointT *  point,
realT *  bestdistp 
)

Definition at line 2047 of file poly2.c.

facetT* qh_newfacet ( void   ) 

Definition at line 958 of file poly.c.

int qh_newhashtable ( int  newsize  ) 

Definition at line 2076 of file poly2.c.

ridgeT* qh_newridge ( void   ) 

Definition at line 991 of file poly.c.

vertexT* qh_newvertex ( pointT *  point  ) 

Definition at line 2097 of file poly2.c.

ridgeT* qh_nextridge3d ( ridgeT *  atridge,
facetT *  facet,
vertexT **  vertexp 
)

Definition at line 2132 of file poly2.c.

void qh_outcoplanar ( void   ) 

Definition at line 2181 of file poly2.c.

pointT* qh_point ( int  id  ) 

Definition at line 2210 of file poly2.c.

void qh_point_add ( setT *  set,
pointT *  point,
void *  elem 
)

Definition at line 2234 of file poly2.c.

setT* qh_pointfacet ( void   ) 

Definition at line 2274 of file poly2.c.

int qh_pointid ( pointT *  point  ) 

Definition at line 1024 of file poly.c.

setT* qh_pointvertex ( void   ) 

Definition at line 2311 of file poly2.c.

void qh_prependfacet ( facetT *  facet,
facetT **  facetlist 
)

Definition at line 2338 of file poly2.c.

void qh_printhashtable ( FILE *  fp  ) 

Definition at line 2374 of file poly2.c.

void qh_printlists ( void   ) 

Definition at line 2412 of file poly2.c.

void qh_removefacet ( facetT *  facet  ) 

Definition at line 1052 of file poly.c.

void qh_removevertex ( vertexT *  vertex  ) 

Definition at line 1083 of file poly.c.

void qh_resetlists ( boolT  stats  ) 

Definition at line 2439 of file poly2.c.

void qh_setvoronoi_all ( void   ) 

Definition at line 2487 of file poly2.c.

void qh_updatevertices ( void   ) 

Definition at line 1119 of file poly.c.

void qh_vertexintersect ( setT **  vertexsetA,
setT *  vertexsetB 
)

Definition at line 2514 of file poly2.c.

setT* qh_vertexintersect_new ( setT *  vertexsetA,
setT *  vertexsetB 
)

Definition at line 2532 of file poly2.c.

void qh_vertexneighbors ( void   ) 

Definition at line 2571 of file poly2.c.

boolT qh_vertexsubset ( setT *  vertexsetA,
setT *  vertexsetB 
)

Definition at line 2603 of file poly2.c.

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines

graspit
Author(s):
autogenerated on Wed Jan 25 10:59:22 2012