Functions
poly_r.c File Reference
#include "qhull_ra.h"
Include dependency graph for poly_r.c:

Go to the source code of this file.

Functions

void qh_appendfacet (qhT *qh, facetT *facet)
 
void qh_appendvertex (qhT *qh, vertexT *vertex)
 
void qh_attachnewfacets (qhT *qh)
 
boolT qh_checkflipped (qhT *qh, facetT *facet, realT *distp, boolT allerror)
 
void qh_deletevisible (qhT *qh)
 
void qh_delfacet (qhT *qh, facetT *facet)
 
setTqh_facetintersect (qhT *qh, facetT *facetA, facetT *facetB, int *skipA, int *skipB, int prepend)
 
int qh_gethash (qhT *qh, int hashsize, setT *set, int size, int firstindex, void *skipelem)
 
facetTqh_makenew_nonsimplicial (qhT *qh, facetT *visible, vertexT *apex, int *numnew)
 
facetTqh_makenew_simplicial (qhT *qh, facetT *visible, vertexT *apex, int *numnew)
 
facetTqh_makenewfacet (qhT *qh, setT *vertices, boolT toporient, facetT *horizon)
 
void qh_makenewplanes (qhT *qh)
 
void qh_matchneighbor (qhT *qh, facetT *newfacet, int newskip, int hashsize, int *hashcount)
 
void qh_matchnewfacets (qhT *qh)
 
boolT qh_matchvertices (qhT *qh, int firstindex, setT *verticesA, int skipA, setT *verticesB, int *skipB, boolT *same)
 
facetTqh_newfacet (qhT *qh)
 
ridgeTqh_newridge (qhT *qh)
 
int qh_pointid (qhT *qh, pointT *point)
 
void qh_removefacet (qhT *qh, facetT *facet)
 
void qh_removevertex (qhT *qh, vertexT *vertex)
 
void qh_updatevertices (qhT *qh)
 

Function Documentation

◆ qh_appendfacet()

void qh_appendfacet ( qhT qh,
facetT facet 
)

Definition at line 38 of file poly_r.c.

◆ qh_appendvertex()

void qh_appendvertex ( qhT qh,
vertexT vertex 
)

Definition at line 72 of file poly_r.c.

◆ qh_attachnewfacets()

void qh_attachnewfacets ( qhT qh)

Definition at line 129 of file poly_r.c.

◆ qh_checkflipped()

boolT qh_checkflipped ( qhT qh,
facetT facet,
realT distp,
boolT  allerror 
)

Definition at line 218 of file poly_r.c.

◆ qh_deletevisible()

void qh_deletevisible ( qhT qh)

Definition at line 292 of file poly_r.c.

◆ qh_delfacet()

void qh_delfacet ( qhT qh,
facetT facet 
)

Definition at line 247 of file poly_r.c.

◆ qh_facetintersect()

setT* qh_facetintersect ( qhT qh,
facetT facetA,
facetT facetB,
int *  skipA,
int *  skipB,
int  prepend 
)

Definition at line 343 of file poly_r.c.

◆ qh_gethash()

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

Definition at line 405 of file poly_r.c.

◆ qh_makenew_nonsimplicial()

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

Definition at line 563 of file poly_r.c.

◆ qh_makenew_simplicial()

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

Definition at line 660 of file poly_r.c.

◆ qh_makenewfacet()

facetT* qh_makenewfacet ( qhT qh,
setT vertices,
boolT  toporient,
facetT horizon 
)

Definition at line 479 of file poly_r.c.

◆ qh_makenewplanes()

void qh_makenewplanes ( qhT qh)

Definition at line 513 of file poly_r.c.

◆ qh_matchneighbor()

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

Definition at line 724 of file poly_r.c.

◆ qh_matchnewfacets()

void qh_matchnewfacets ( qhT qh)

Definition at line 841 of file poly_r.c.

◆ qh_matchvertices()

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

Definition at line 952 of file poly_r.c.

◆ qh_newfacet()

facetT* qh_newfacet ( qhT qh)

Definition at line 985 of file poly_r.c.

◆ qh_newridge()

ridgeT* qh_newridge ( qhT qh)

Definition at line 1018 of file poly_r.c.

◆ qh_pointid()

int qh_pointid ( qhT qh,
pointT point 
)

Definition at line 1053 of file poly_r.c.

◆ qh_removefacet()

void qh_removefacet ( qhT qh,
facetT facet 
)

Definition at line 1084 of file poly_r.c.

◆ qh_removevertex()

void qh_removevertex ( qhT qh,
vertexT vertex 
)

Definition at line 1115 of file poly_r.c.

◆ qh_updatevertices()

void qh_updatevertices ( qhT qh)

Definition at line 1155 of file poly_r.c.



hpp-fcl
Author(s):
autogenerated on Sat Nov 23 2024 03:44:59