#include "libqhull_r.h"

Include dependency graph for poly_r.h:

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

Macros
#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 (qhT qh, facetT facet)

void	qh_appendvertex (qhT qh, vertexT vertex)

void	qh_attachnewfacets (qhT *qh)

void	qh_check_bestdist (qhT *qh)

void	qh_check_dupridge (qhT qh, facetT facet1, realT dist1, facetT *facet2, realT dist2)

void	qh_check_maxout (qhT *qh)

void	qh_check_output (qhT *qh)

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

void	qh_check_points (qhT *qh)

void	qh_checkconvex (qhT qh, facetT facetlist, int fault)

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

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

void	qh_checkflipped_all (qhT qh, facetT facetlist)

void	qh_checkpolygon (qhT qh, facetT facetlist)

void	qh_checkvertex (qhT qh, vertexT vertex)

void	qh_clearcenters (qhT *qh, qh_CENTER type)

void	qh_createsimplex (qhT qh, setT vertices)

void	qh_deletevisible (qhT *qh)

void	qh_delfacet (qhT qh, facetT facet)

void	qh_delridge (qhT qh, ridgeT ridge)

void	qh_delvertex (qhT qh, vertexT vertex)

setT *	qh_facet3vertex (qhT qh, facetT facet)

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

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

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

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

int	qh_findgood (qhT qh, facetT facetlist, int goodhorizon)

void	qh_findgood_all (qhT qh, facetT facetlist)

void	qh_furthestnext (qhT *qh)

void	qh_furthestout (qhT qh, facetT facet)

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

void	qh_infiniteloop (qhT qh, facetT facet)

void	qh_initbuild (qhT *qh)

void	qh_initialhull (qhT qh, setT vertices)

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

vertexT *	qh_isvertex (pointT point, setT vertices)

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

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

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

vertexT *	qh_makenewfacets (qhT qh, pointT point)

void	qh_makenewplanes (qhT *qh)

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

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)

void	qh_nearcoplanar (qhT *qh)

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

facetT *	qh_newfacet (qhT *qh)

int	qh_newhashtable (qhT *qh, int newsize)

ridgeT *	qh_newridge (qhT *qh)

vertexT *	qh_newvertex (qhT qh, pointT point)

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

void	qh_outcoplanar (qhT *qh)

pointT *	qh_point (qhT *qh, int id)

void	qh_point_add (qhT qh, setT set, pointT point, void elem)

setT *	qh_pointfacet (qhT *qh)

int	qh_pointid (qhT qh, pointT point)

setT *	qh_pointvertex (qhT *qh)

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

void	qh_printhashtable (qhT qh, FILE fp)

void	qh_printlists (qhT *qh)

void	qh_removefacet (qhT qh, facetT facet)

void	qh_removevertex (qhT qh, vertexT vertex)

void	qh_resetlists (qhT *qh, boolT stats, boolT resetVisible)

void	qh_setvoronoi_all (qhT *qh)

void	qh_triangulate (qhT *qh)

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

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

void	qh_triangulate_mirror (qhT qh, facetT facetA, facetT *facetB)

void	qh_triangulate_null (qhT qh, facetT facetA)

void	qh_updatevertices (qhT *qh)

void	qh_vertexintersect (qhT qh, setT vertexsetA, setT vertexsetB)

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

void	qh_vertexneighbors (qhT *qh)

boolT	qh_vertexsubset (setT vertexsetA, setT vertexsetB)

Macro Definition Documentation

◆ FORALLfacet_

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

Definition at line 77 of file poly_r.h.

◆ FORALLnew_facets

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

Definition at line 89 of file poly_r.h.

◆ FORALLsame_

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

Definition at line 125 of file poly_r.h.

◆ FORALLsame_cycle_

#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_r.h.

◆ FORALLvertex_

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

Definition at line 101 of file poly_r.h.

◆ FORALLvisible_facets

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

Definition at line 113 of file poly_r.h.

◆ FOREACHneighborA_

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

Definition at line 156 of file poly_r.h.

◆ FOREACHnewfacet_

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

Definition at line 180 of file poly_r.h.

◆ FOREACHvertexA_

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

Definition at line 192 of file poly_r.h.

◆ FOREACHvertexreverse12_

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

Definition at line 205 of file poly_r.h.

◆ FOREACHvisible_

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

Definition at line 168 of file poly_r.h.

◆ qh_ALGORITHMfault

#define qh_ALGORITHMfault 0

Definition at line 27 of file poly_r.h.

◆ qh_DATAfault

#define qh_DATAfault 1

Definition at line 35 of file poly_r.h.

◆ qh_DUPLICATEridge

#define qh_DUPLICATEridge (facetT *)1L

Definition at line 46 of file poly_r.h.

◆ qh_MERGEridge

#define qh_MERGEridge (facetT *)2L

Definition at line 57 of file poly_r.h.

Function Documentation

◆ qh_addhash()

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

Definition at line 26 of file poly2.c.

◆ 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_check_bestdist()

void qh_check_bestdist ( qhT * qh )

Definition at line 66 of file poly2_r.c.

◆ qh_check_dupridge()

void qh_check_dupridge	(	qhT *	qh,
		facetT *	facet1,
		realT	dist1,
		facetT *	facet2,
		realT	dist2
	)

Definition at line 150 of file poly2_r.c.

◆ qh_check_maxout()

void qh_check_maxout ( qhT * qh )

Definition at line 218 of file poly2_r.c.

◆ qh_check_output()

void qh_check_output ( qhT * qh )

Definition at line 302 of file poly2_r.c.

◆ qh_check_point()

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

Definition at line 325 of file poly2_r.c.

◆ qh_check_points()

void qh_check_points ( qhT * qh )

Definition at line 365 of file poly2_r.c.

◆ qh_checkconvex()

void qh_checkconvex	(	qhT *	qh,
		facetT *	facetlist,
		int	fault
	)

Definition at line 475 of file poly2_r.c.

◆ qh_checkfacet()

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

Definition at line 627 of file poly2_r.c.

◆ qh_checkflipped()

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

Definition at line 218 of file poly_r.c.

◆ qh_checkflipped_all()

void qh_checkflipped_all	(	qhT *	qh,
		facetT *	facetlist
	)

Definition at line 831 of file poly2_r.c.

◆ qh_checkpolygon()

void qh_checkpolygon	(	qhT *	qh,
		facetT *	facetlist
	)

Definition at line 878 of file poly2_r.c.

◆ qh_checkvertex()

void qh_checkvertex	(	qhT *	qh,
		vertexT *	vertex
	)

Definition at line 1001 of file poly2_r.c.

◆ qh_clearcenters()

void qh_clearcenters	(	qhT *	qh,
		qh_CENTER	type
	)

Definition at line 1040 of file poly2_r.c.

◆ qh_createsimplex()

void qh_createsimplex	(	qhT *	qh,
		setT *	vertices
	)

Definition at line 1082 of file poly2_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_delridge()

void qh_delridge	(	qhT *	qh,
		ridgeT *	ridge
	)

Definition at line 1126 of file poly2_r.c.

◆ qh_delvertex()

void qh_delvertex	(	qhT *	qh,
		vertexT *	vertex
	)

Definition at line 1146 of file poly2_r.c.

◆ qh_facet3vertex()

setT* qh_facet3vertex	(	qhT *	qh,
		facetT *	facet
	)

Definition at line 1169 of file poly2_r.c.

◆ qh_facetintersect()

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

Definition at line 343 of file poly_r.c.

◆ qh_findbestfacet()

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

Definition at line 1239 of file poly2_r.c.

◆ qh_findbestlower()

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

Definition at line 1278 of file poly2_r.c.

◆ qh_findfacet_all()

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

Definition at line 1348 of file poly2_r.c.

◆ qh_findgood()

int qh_findgood	(	qhT *	qh,
		facetT *	facetlist,
		int	goodhorizon
	)

Definition at line 1408 of file poly2_r.c.

◆ qh_findgood_all()

void qh_findgood_all	(	qhT *	qh,
		facetT *	facetlist
	)

Definition at line 1508 of file poly2_r.c.

◆ qh_furthestnext()

void qh_furthestnext ( qhT * qh )

Definition at line 1578 of file poly2_r.c.

◆ qh_furthestout()

void qh_furthestout	(	qhT *	qh,
		facetT *	facet
	)

Definition at line 1621 of file poly2_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_infiniteloop()

void qh_infiniteloop	(	qhT *	qh,
		facetT *	facet
	)

Definition at line 1652 of file poly2_r.c.

◆ qh_initbuild()

void qh_initbuild ( qhT * qh )

Definition at line 1683 of file poly2_r.c.

◆ qh_initialhull()

void qh_initialhull	(	qhT *	qh,
		setT *	vertices
	)

Definition at line 1802 of file poly2_r.c.

◆ qh_initialvertices()

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

Definition at line 1892 of file poly2_r.c.

◆ qh_isvertex()

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

Definition at line 1975 of file poly2.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 *	facet
	)

Definition at line 479 of file poly_r.c.

◆ qh_makenewfacets()

vertexT* qh_makenewfacets	(	qhT *	qh,
		pointT *	point
	)

Definition at line 2020 of file poly2_r.c.

◆ qh_makenewplanes()

void qh_makenewplanes ( qhT * qh )

Definition at line 513 of file poly_r.c.

◆ qh_matchduplicates()

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

Definition at line 2088 of file poly2_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_nearcoplanar()

void qh_nearcoplanar ( qhT * qh )

Definition at line 2198 of file poly2_r.c.

◆ qh_nearvertex()

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

Definition at line 2248 of file poly2_r.c.

◆ qh_newfacet()

facetT* qh_newfacet ( qhT * qh )

Definition at line 985 of file poly_r.c.

◆ qh_newhashtable()

int qh_newhashtable	(	qhT *	qh,
		int	newsize
	)

Definition at line 2304 of file poly2_r.c.

◆ qh_newridge()

ridgeT* qh_newridge ( qhT * qh )

Definition at line 1018 of file poly_r.c.

◆ qh_newvertex()

vertexT* qh_newvertex	(	qhT *	qh,
		pointT *	point
	)

Definition at line 2329 of file poly2_r.c.

◆ qh_nextridge3d()

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

Definition at line 2368 of file poly2.c.

◆ qh_outcoplanar()

void qh_outcoplanar ( qhT * qh )

Definition at line 2417 of file poly2_r.c.

◆ qh_point()

pointT* qh_point	(	qhT *	qh,
		int	id
	)

Definition at line 2446 of file poly2_r.c.

◆ qh_point_add()

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

Definition at line 2470 of file poly2_r.c.

◆ qh_pointfacet()

setT* qh_pointfacet ( qhT * qh )

Definition at line 2510 of file poly2_r.c.

◆ qh_pointid()

int qh_pointid	(	qhT *	qh,
		pointT *	point
	)

Definition at line 1053 of file poly_r.c.

◆ qh_pointvertex()

setT* qh_pointvertex ( qhT * qh )

Definition at line 2547 of file poly2_r.c.

◆ qh_prependfacet()

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

Definition at line 2574 of file poly2_r.c.

◆ qh_printhashtable()

void qh_printhashtable	(	qhT *	qh,
		FILE *	fp
	)

Definition at line 2613 of file poly2_r.c.

◆ qh_printlists()

void qh_printlists ( qhT * qh )

Definition at line 2651 of file poly2_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_resetlists()

void qh_resetlists	(	qhT *	qh,
		boolT	stats,
		boolT	resetVisible
	)

Definition at line 2685 of file poly2_r.c.

◆ qh_setvoronoi_all()

void qh_setvoronoi_all ( qhT * qh )

Definition at line 2735 of file poly2_r.c.

◆ qh_triangulate()

void qh_triangulate ( qhT * qh )

Definition at line 2767 of file poly2_r.c.

◆ qh_triangulate_facet()

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

Definition at line 2954 of file poly2_r.c.

◆ qh_triangulate_link()

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

Definition at line 3029 of file poly2_r.c.

◆ qh_triangulate_mirror()

void qh_triangulate_mirror	(	qhT *	qh,
		facetT *	facetA,
		facetT *	facetB
	)

Definition at line 3060 of file poly2_r.c.

◆ qh_triangulate_null()

void qh_triangulate_null	(	qhT *	qh,
		facetT *	facetA
	)

Definition at line 3089 of file poly2_r.c.

◆ qh_updatevertices()

void qh_updatevertices ( qhT * qh )

Definition at line 1155 of file poly_r.c.

◆ qh_vertexintersect()

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

Definition at line 3117 of file poly2_r.c.

◆ qh_vertexintersect_new()

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

Definition at line 3135 of file poly2_r.c.

◆ qh_vertexneighbors()

void qh_vertexneighbors ( qhT * qh )

Definition at line 3174 of file poly2_r.c.

◆ qh_vertexsubset()

boolT qh_vertexsubset	(	setT *	vertexsetA,
		setT *	vertexsetB
	)

Definition at line 3206 of file poly2.c.

Macros

Functions