#include "qhull_a.h"
Go to the source code of this file.
Functions | |
void | qh_addhash (void *newelem, setT *hashtable, int hashsize, int hash) |
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) |
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_delridge (ridgeT *ridge) |
void | qh_delvertex (vertexT *vertex) |
setT * | qh_facet3vertex (facetT *facet) |
facetT * | qh_findbestfacet (pointT *point, boolT bestoutside, realT *bestdist, boolT *isoutside) |
facetT * | qh_findbestlower (facetT *upperfacet, pointT *point, realT *bestdistp, int *numpart) |
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) |
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) |
vertexT * | qh_makenewfacets (pointT *point) |
void | qh_matchduplicates (facetT *atfacet, int atskip, int hashsize, int *hashcount) |
void | qh_nearcoplanar (void) |
vertexT * | qh_nearvertex (facetT *facet, pointT *point, realT *bestdistp) |
int | qh_newhashtable (int newsize) |
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) |
setT * | qh_pointvertex (void) |
void | qh_prependfacet (facetT *facet, facetT **facetlist) |
void | qh_printhashtable (FILE *fp) |
void | qh_printlists (void) |
void | qh_resetlists (boolT stats, boolT resetVisible) |
void | qh_setvoronoi_all (void) |
void | qh_triangulate (void) |
void | qh_triangulate_facet (facetT *facetA, vertexT **first_vertex) |
void | qh_triangulate_link (facetT *oldfacetA, facetT *facetA, facetT *oldfacetB, facetT *facetB) |
void | qh_triangulate_mirror (facetT *facetA, facetT *facetB) |
void | qh_triangulate_null (facetT *facetA) |
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) |
void qh_addhash | ( | void * | newelem, |
setT * | hashtable, | ||
int | hashsize, | ||
int | hash | ||
) |
void qh_check_bestdist | ( | void | ) |
void qh_check_maxout | ( | void | ) |
void qh_check_output | ( | void | ) |
void qh_check_points | ( | void | ) |
void qh_checkconvex | ( | facetT * | facetlist, |
int | fault | ||
) |
void qh_checkfacet | ( | facetT * | facet, |
boolT | newmerge, | ||
boolT * | waserrorp | ||
) |
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_delridge | ( | ridgeT * | ridge | ) |
void qh_delvertex | ( | vertexT * | vertex | ) |
setT* qh_facet3vertex | ( | facetT * | facet | ) |
facetT* qh_findbestlower | ( | facetT * | upperfacet, |
pointT * | point, | ||
realT * | bestdistp, | ||
int * | numpart | ||
) |
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 | ) |
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_makenewfacets | ( | pointT * | point | ) |
void qh_matchduplicates | ( | facetT * | atfacet, |
int | atskip, | ||
int | hashsize, | ||
int * | hashcount | ||
) |
void qh_nearcoplanar | ( | void | ) |
vertexT* qh_nearvertex | ( | facetT * | facet, |
pointT * | point, | ||
realT * | bestdistp | ||
) |
int qh_newhashtable | ( | int | newsize | ) |
vertexT* qh_newvertex | ( | pointT * | point | ) |
ridgeT* qh_nextridge3d | ( | ridgeT * | atridge, |
facetT * | facet, | ||
vertexT ** | vertexp | ||
) |
void qh_outcoplanar | ( | void | ) |
void qh_point_add | ( | setT * | set, |
pointT * | point, | ||
void * | elem | ||
) |
setT* qh_pointfacet | ( | void | ) |
setT* qh_pointvertex | ( | void | ) |
void qh_prependfacet | ( | facetT * | facet, |
facetT ** | facetlist | ||
) |
void qh_printhashtable | ( | FILE * | fp | ) |
void qh_printlists | ( | void | ) |
void qh_resetlists | ( | boolT | stats, |
boolT | resetVisible | ||
) |
void qh_setvoronoi_all | ( | void | ) |
void qh_triangulate | ( | void | ) |
void qh_triangulate_facet | ( | facetT * | facetA, |
vertexT ** | first_vertex | ||
) |
void qh_triangulate_link | ( | facetT * | oldfacetA, |
facetT * | facetA, | ||
facetT * | oldfacetB, | ||
facetT * | facetB | ||
) |
void qh_triangulate_mirror | ( | facetT * | facetA, |
facetT * | facetB | ||
) |
void qh_triangulate_null | ( | facetT * | facetA | ) |
void qh_vertexintersect | ( | setT ** | vertexsetA, |
setT * | vertexsetB | ||
) |
setT* qh_vertexintersect_new | ( | setT * | vertexsetA, |
setT * | vertexsetB | ||
) |
void qh_vertexneighbors | ( | void | ) |