#include "libqhull.h"

Include dependency graph for poly.h:

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

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	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
Functions
void	qh_addhash (void newelem, setT hashtable, int hashsize, int 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_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)
int	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, 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_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 77 of file poly.h.

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

Definition at line 89 of file poly.h.

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

Definition at line 125 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 137 of file poly.h.

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

Definition at line 101 of file poly.h.

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

Definition at line 113 of file poly.h.

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

Definition at line 156 of file poly.h.

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

Definition at line 180 of file poly.h.

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

Definition at line 192 of file poly.h.

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

Definition at line 205 of file poly.h.

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

Definition at line 168 of file poly.h.

#define qh_ALGORITHMfault 0

Definition at line 27 of file poly.h.

#define qh_DATAfault 1

Definition at line 35 of file poly.h.

#define qh_DUPLICATEridge (facetT *)1L

Definition at line 46 of file poly.h.

#define qh_MERGEridge (facetT *)2L

Definition at line 57 of file poly.h.

Function Documentation

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

Definition at line 26 of file poly2.c.

void qh_appendfacet ( facetT * facet )

Definition at line 38 of file poly.c.

void qh_appendvertex ( vertexT * vertex )

Definition at line 72 of file poly.c.

void qh_attachnewfacets ( void )

Definition at line 129 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 167 of file poly2.c.

void qh_check_output ( void )

Definition at line 251 of file poly2.c.

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

Definition at line 274 of file poly2.c.

void qh_check_points ( void )

Definition at line 314 of file poly2.c.

void qh_checkconvex	(	facetT *	facetlist,
		int	fault
	)

Definition at line 424 of file poly2.c.

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

Definition at line 576 of file poly2.c.

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

Definition at line 218 of file poly.c.

void qh_checkflipped_all ( facetT * facetlist )

Definition at line 780 of file poly2.c.

void qh_checkpolygon ( facetT * facetlist )

Definition at line 827 of file poly2.c.

void qh_checkvertex ( vertexT * vertex )

Definition at line 950 of file poly2.c.

void qh_clearcenters ( qh_CENTER type )

Definition at line 989 of file poly2.c.

void qh_createsimplex ( setT * vertices )

Definition at line 1031 of file poly2.c.

void qh_deletevisible ( void )

Definition at line 292 of file poly.c.

void qh_delfacet ( facetT * facet )

Definition at line 247 of file poly.c.

void qh_delridge ( ridgeT * ridge )

Definition at line 1075 of file poly2.c.

void qh_delvertex ( vertexT * vertex )

Definition at line 1095 of file poly2.c.

setT* qh_facet3vertex ( facetT * facet )

Definition at line 1118 of file poly2.c.

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

Definition at line 343 of file poly.c.

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

Definition at line 1188 of file poly2.c.

facetT* qh_findbestlower	(	facetT *	upperfacet,
		pointT *	point,
		realT *	bestdistp,
		int *	numpart
	)

Definition at line 1227 of file poly2.c.

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

Definition at line 1294 of file poly2.c.

int qh_findgood	(	facetT *	facetlist,
		int	goodhorizon
	)

Definition at line 1354 of file poly2.c.

void qh_findgood_all ( facetT * facetlist )

Definition at line 1454 of file poly2.c.

void qh_furthestnext ( void )

Definition at line 1524 of file poly2.c.

void qh_furthestout ( facetT * facet )

Definition at line 1567 of file poly2.c.

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

Definition at line 405 of file poly.c.

void qh_infiniteloop ( facetT * facet )

Definition at line 1598 of file poly2.c.

void qh_initbuild ( void )

Definition at line 1629 of file poly2.c.

void qh_initialhull ( setT * vertices )

Definition at line 1748 of file poly2.c.

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

Definition at line 1831 of file poly2.c.

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

Definition at line 1914 of file poly2.c.

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

Definition at line 563 of file poly.c.

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

Definition at line 660 of file poly.c.

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

Definition at line 479 of file poly.c.

vertexT* qh_makenewfacets ( pointT * point )

Definition at line 1959 of file poly2.c.

void qh_makenewplanes ( void )

Definition at line 513 of file poly.c.

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

Definition at line 2027 of file poly2.c.

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

Definition at line 724 of file poly.c.

void qh_matchnewfacets ( void )

Definition at line 836 of file poly.c.

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

Definition at line 946 of file poly.c.

void qh_nearcoplanar ( void )

Definition at line 2137 of file poly2.c.

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

Definition at line 2187 of file poly2.c.

facetT* qh_newfacet ( void )

Definition at line 979 of file poly.c.

int qh_newhashtable ( int newsize )

Definition at line 2239 of file poly2.c.

ridgeT* qh_newridge ( void )

Definition at line 1012 of file poly.c.

vertexT* qh_newvertex ( pointT * point )

Definition at line 2264 of file poly2.c.

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

Definition at line 2304 of file poly2.c.

void qh_outcoplanar ( void )

Definition at line 2353 of file poly2.c.

pointT* qh_point ( int id )

Definition at line 2382 of file poly2.c.

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

Definition at line 2406 of file poly2.c.

setT* qh_pointfacet ( void )

Definition at line 2446 of file poly2.c.

int qh_pointid ( pointT * point )

Definition at line 1047 of file poly.c.

setT* qh_pointvertex ( void )

Definition at line 2483 of file poly2.c.

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

Definition at line 2510 of file poly2.c.

void qh_printhashtable ( FILE * fp )

Definition at line 2549 of file poly2.c.

void qh_printlists ( void )

Definition at line 2587 of file poly2.c.

void qh_removefacet ( facetT * facet )

Definition at line 1078 of file poly.c.

void qh_removevertex ( vertexT * vertex )

Definition at line 1109 of file poly.c.

void qh_resetlists	(	boolT	stats,
		boolT	resetVisible
	)

Definition at line 2621 of file poly2.c.

void qh_setvoronoi_all ( void )

Definition at line 2671 of file poly2.c.

void qh_triangulate ( void )

Definition at line 2703 of file poly2.c.

void qh_triangulate_facet	(	facetT *	facetA,
		vertexT **	first_vertex
	)

Definition at line 2885 of file poly2.c.

void qh_triangulate_link	(	facetT *	oldfacetA,
		facetT *	facetA,
		facetT *	oldfacetB,
		facetT *	facetB
	)

Definition at line 2954 of file poly2.c.

void qh_triangulate_mirror	(	facetT *	facetA,
		facetT *	facetB
	)

Definition at line 2985 of file poly2.c.

void qh_triangulate_null ( facetT * facetA )

Definition at line 3014 of file poly2.c.

void qh_updatevertices ( void )

Definition at line 1149 of file poly.c.

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

Definition at line 3042 of file poly2.c.

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

Definition at line 3060 of file poly2.c.

void qh_vertexneighbors ( void )

Definition at line 3099 of file poly2.c.

boolT qh_vertexsubset	(	setT *	vertexsetA,
		setT *	vertexsetB
	)

Definition at line 3131 of file poly2.c.

Defines

Functions

Define Documentation

Function Documentation