#include "qhull_ra.h"

Include dependency graph for merge_r.c:

Functions
void	qh_all_merges (qhT *qh, boolT othermerge, boolT vneighbors)

void	qh_appendmergeset (qhT qh, facetT facet, facetT neighbor, mergeType mergetype, realT angle)

setT *	qh_basevertices (qhT qh, facetT samecycle)

void	qh_checkconnect (qhT *qh)

boolT	qh_checkzero (qhT *qh, boolT testall)

int	qh_compareangle (const void p1, const void p2)

int	qh_comparemerge (const void p1, const void p2)

int	qh_comparevisit (const void p1, const void p2)

void	qh_copynonconvex (qhT qh, ridgeT atridge)

void	qh_degen_redundant_facet (qhT qh, facetT facet)

void	qh_degen_redundant_neighbors (qhT qh, facetT facet, facetT *delfacet)

vertexT *	qh_find_newvertex (qhT qh, vertexT oldvertex, setT vertices, setT ridges)

void	qh_findbest_test (qhT qh, boolT testcentrum, facetT facet, facetT neighbor, facetT bestfacet, realT distp, realT mindistp, realT maxdistp)

facetT *	qh_findbestneighbor (qhT qh, facetT facet, realT distp, realT mindistp, realT *maxdistp)

void	qh_flippedmerges (qhT qh, facetT facetlist, boolT *wasmerge)

void	qh_forcedmerges (qhT qh, boolT wasmerge)

void	qh_getmergeset (qhT qh, facetT facetlist)

void	qh_getmergeset_initial (qhT qh, facetT facetlist)

void	qh_hashridge (qhT qh, setT hashtable, int hashsize, ridgeT ridge, vertexT oldvertex)

ridgeT *	qh_hashridge_find (qhT qh, setT hashtable, int hashsize, ridgeT ridge, vertexT vertex, vertexT oldvertex, int hashslot)

void	qh_makeridges (qhT qh, facetT facet)

void	qh_mark_dupridges (qhT qh, facetT facetlist)

void	qh_maydropneighbor (qhT qh, facetT facet)

int	qh_merge_degenredundant (qhT *qh)

void	qh_merge_nonconvex (qhT qh, facetT facet1, facetT *facet2, mergeType mergetype)

void	qh_mergecycle (qhT qh, facetT samecycle, facetT *newfacet)

void	qh_mergecycle_all (qhT qh, facetT facetlist, boolT *wasmerge)

void	qh_mergecycle_facets (qhT qh, facetT samecycle, facetT *newfacet)

void	qh_mergecycle_neighbors (qhT qh, facetT samecycle, facetT *newfacet)

void	qh_mergecycle_ridges (qhT qh, facetT samecycle, facetT *newfacet)

void	qh_mergecycle_vneighbors (qhT qh, facetT samecycle, facetT *newfacet)

void	qh_mergefacet (qhT qh, facetT facet1, facetT facet2, realT mindist, realT *maxdist, boolT mergeapex)

void	qh_mergefacet2d (qhT qh, facetT facet1, facetT *facet2)

void	qh_mergeneighbors (qhT qh, facetT facet1, facetT *facet2)

void	qh_mergeridges (qhT qh, facetT facet1, facetT *facet2)

void	qh_mergesimplex (qhT qh, facetT facet1, facetT *facet2, boolT mergeapex)

void	qh_mergevertex_del (qhT qh, vertexT vertex, facetT facet1, facetT facet2)

void	qh_mergevertex_neighbors (qhT qh, facetT facet1, facetT *facet2)

void	qh_mergevertices (qhT qh, setT vertices1, setT **vertices2)

setT *	qh_neighbor_intersections (qhT qh, vertexT vertex)

void	qh_newvertices (qhT qh, setT vertices)

void	qh_postmerge (qhT qh, const char reason, realT maxcentrum, realT maxangle, boolT vneighbors)

void	qh_premerge (qhT qh, vertexT apex, realT maxcentrum, realT maxangle)

boolT	qh_reducevertices (qhT *qh)

vertexT *	qh_redundant_vertex (qhT qh, vertexT vertex)

boolT	qh_remove_extravertices (qhT qh, facetT facet)

vertexT *	qh_rename_sharedvertex (qhT qh, vertexT vertex, facetT *facet)

void	qh_renameridgevertex (qhT qh, ridgeT ridge, vertexT oldvertex, vertexT newvertex)

void	qh_renamevertex (qhT qh, vertexT oldvertex, vertexT newvertex, setT ridges, facetT oldfacet, facetT neighborA)

boolT	qh_test_appendmerge (qhT qh, facetT facet, facetT *neighbor)

boolT	qh_test_vneighbors (qhT *qh)

void	qh_tracemerge (qhT qh, facetT facet1, facetT *facet2)

void	qh_tracemerging (qhT *qh)

void	qh_updatetested (qhT qh, facetT facet1, facetT *facet2)

setT *	qh_vertexridges (qhT qh, vertexT vertex)

void	qh_vertexridges_facet (qhT qh, vertexT vertex, facetT facet, setT *ridges)

void	qh_willdelete (qhT qh, facetT facet, facetT *replace)

Function Documentation

◆ qh_all_merges()

void qh_all_merges	(	qhT *	qh,
		boolT	othermerge,
		boolT	vneighbors
	)

Definition at line 215 of file merge_r.c.

◆ qh_appendmergeset()

void qh_appendmergeset	(	qhT *	qh,
		facetT *	facet,
		facetT *	neighbor,
		mergeType	mergetype,
		realT *	angle
	)

Definition at line 320 of file merge_r.c.

◆ qh_basevertices()

setT* qh_basevertices	(	qhT *	qh,
		facetT *	samecycle
	)

Definition at line 384 of file merge_r.c.

◆ qh_checkconnect()

void qh_checkconnect ( qhT * qh )

Definition at line 425 of file merge_r.c.

◆ qh_checkzero()

boolT qh_checkzero	(	qhT *	qh,
		boolT	testall
	)

Definition at line 488 of file merge_r.c.

◆ qh_compareangle()

int qh_compareangle	(	const void *	p1,
		const void *	p2
	)

Definition at line 569 of file merge_r.c.

◆ qh_comparemerge()

int qh_comparemerge	(	const void *	p1,
		const void *	p2
	)

Definition at line 581 of file merge_r.c.

◆ qh_comparevisit()

int qh_comparevisit	(	const void *	p1,
		const void *	p2
	)

Definition at line 593 of file merge_r.c.

◆ qh_copynonconvex()

void qh_copynonconvex	(	qhT *	qh,
		ridgeT *	atridge
	)

Definition at line 613 of file merge_r.c.

◆ qh_degen_redundant_facet()

void qh_degen_redundant_facet	(	qhT *	qh,
		facetT *	facet
	)

Definition at line 647 of file merge_r.c.

◆ qh_degen_redundant_neighbors()

void qh_degen_redundant_neighbors	(	qhT *	qh,
		facetT *	facet,
		facetT *	delfacet
	)

Definition at line 703 of file merge_r.c.

◆ qh_find_newvertex()

vertexT* qh_find_newvertex	(	qhT *	qh,
		vertexT *	oldvertex,
		setT *	vertices,
		setT *	ridges
	)

Definition at line 773 of file merge_r.c.

◆ qh_findbest_test()

void qh_findbest_test	(	qhT *	qh,
		boolT	testcentrum,
		facetT *	facet,
		facetT *	neighbor,
		facetT **	bestfacet,
		realT *	distp,
		realT *	mindistp,
		realT *	maxdistp
	)

Definition at line 860 of file merge_r.c.

◆ qh_findbestneighbor()

facetT* qh_findbestneighbor	(	qhT *	qh,
		facetT *	facet,
		realT *	distp,
		realT *	mindistp,
		realT *	maxdistp
	)

Definition at line 913 of file merge_r.c.

◆ qh_flippedmerges()

void qh_flippedmerges	(	qhT *	qh,
		facetT *	facetlist,
		boolT *	wasmerge
	)

Definition at line 981 of file merge_r.c.

◆ qh_forcedmerges()

void qh_forcedmerges	(	qhT *	qh,
		boolT *	wasmerge
	)

Definition at line 1055 of file merge_r.c.

◆ qh_getmergeset()

void qh_getmergeset	(	qhT *	qh,
		facetT *	facetlist
	)

Definition at line 1150 of file merge_r.c.

◆ qh_getmergeset_initial()

void qh_getmergeset_initial	(	qhT *	qh,
		facetT *	facetlist
	)

Definition at line 1223 of file merge_r.c.

◆ qh_hashridge()

void qh_hashridge	(	qhT *	qh,
		setT *	hashtable,
		int	hashsize,
		ridgeT *	ridge,
		vertexT *	oldvertex
	)

Definition at line 1275 of file merge_r.c.

◆ qh_hashridge_find()

ridgeT* qh_hashridge_find	(	qhT *	qh,
		setT *	hashtable,
		int	hashsize,
		ridgeT *	ridge,
		vertexT *	vertex,
		vertexT *	oldvertex,
		int *	hashslot
	)

Definition at line 1318 of file merge_r.c.

◆ qh_makeridges()

void qh_makeridges	(	qhT *	qh,
		facetT *	facet
	)

Definition at line 1369 of file merge_r.c.

◆ qh_mark_dupridges()

void qh_mark_dupridges	(	qhT *	qh,
		facetT *	facetlist
	)

Definition at line 1459 of file merge_r.c.

◆ qh_maydropneighbor()

void qh_maydropneighbor	(	qhT *	qh,
		facetT *	facet
	)

Definition at line 1523 of file merge_r.c.

◆ qh_merge_degenredundant()

int qh_merge_degenredundant ( qhT * qh )

Definition at line 1583 of file merge_r.c.

◆ qh_merge_nonconvex()

void qh_merge_nonconvex	(	qhT *	qh,
		facetT *	facet1,
		facetT *	facet2,
		mergeType	mergetype
	)

Definition at line 1672 of file merge_r.c.

◆ qh_mergecycle()

void qh_mergecycle	(	qhT *	qh,
		facetT *	samecycle,
		facetT *	newfacet
	)

Definition at line 1750 of file merge_r.c.

◆ qh_mergecycle_all()

void qh_mergecycle_all	(	qhT *	qh,
		facetT *	facetlist,
		boolT *	wasmerge
	)

Definition at line 1840 of file merge_r.c.

◆ qh_mergecycle_facets()

void qh_mergecycle_facets	(	qhT *	qh,
		facetT *	samecycle,
		facetT *	newfacet
	)

Definition at line 1928 of file merge_r.c.

◆ qh_mergecycle_neighbors()

void qh_mergecycle_neighbors	(	qhT *	qh,
		facetT *	samecycle,
		facetT *	newfacet
	)

Definition at line 1986 of file merge_r.c.

◆ qh_mergecycle_ridges()

void qh_mergecycle_ridges	(	qhT *	qh,
		facetT *	samecycle,
		facetT *	newfacet
	)

Definition at line 2083 of file merge_r.c.

◆ qh_mergecycle_vneighbors()

void qh_mergecycle_vneighbors	(	qhT *	qh,
		facetT *	samecycle,
		facetT *	newfacet
	)

Definition at line 2185 of file merge_r.c.

◆ qh_mergefacet()

void qh_mergefacet	(	qhT *	qh,
		facetT *	facet1,
		facetT *	facet2,
		realT *	mindist,
		realT *	maxdist,
		boolT	mergeapex
	)

Definition at line 2270 of file merge_r.c.

◆ qh_mergefacet2d()

void qh_mergefacet2d	(	qhT *	qh,
		facetT *	facet1,
		facetT *	facet2
	)

Definition at line 2421 of file merge_r.c.

◆ qh_mergeneighbors()

void qh_mergeneighbors	(	qhT *	qh,
		facetT *	facet1,
		facetT *	facet2
	)

Definition at line 2496 of file merge_r.c.

◆ qh_mergeridges()

void qh_mergeridges	(	qhT *	qh,
		facetT *	facet1,
		facetT *	facet2
	)

Definition at line 2544 of file merge_r.c.

◆ qh_mergesimplex()

void qh_mergesimplex	(	qhT *	qh,
		facetT *	facet1,
		facetT *	facet2,
		boolT	mergeapex
	)

Definition at line 2611 of file merge_r.c.

◆ qh_mergevertex_del()

void qh_mergevertex_del	(	qhT *	qh,
		vertexT *	vertex,
		facetT *	facet1,
		facetT *	facet2
	)

Definition at line 2723 of file merge_r.c.

◆ qh_mergevertex_neighbors()

void qh_mergevertex_neighbors	(	qhT *	qh,
		facetT *	facet1,
		facetT *	facet2
	)

Definition at line 2749 of file merge_r.c.

◆ qh_mergevertices()

void qh_mergevertices	(	qhT *	qh,
		setT *	vertices1,
		setT **	vertices2
	)

Definition at line 2787 of file merge_r.c.

◆ qh_neighbor_intersections()

setT* qh_neighbor_intersections	(	qhT *	qh,
		vertexT *	vertex
	)

Definition at line 2840 of file merge_r.c.

◆ qh_newvertices()

void qh_newvertices	(	qhT *	qh,
		setT *	vertices
	)

Definition at line 2886 of file merge_r.c.

◆ qh_postmerge()

void qh_postmerge	(	qhT *	qh,
		const char *	reason,
		realT	maxcentrum,
		realT	maxangle,
		boolT	vneighbors
	)

Definition at line 129 of file merge_r.c.

◆ qh_premerge()

void qh_premerge	(	qhT *	qh,
		vertexT *	apex,
		realT	maxcentrum,
		realT	maxangle
	)

Definition at line 56 of file merge_r.c.

◆ qh_reducevertices()

boolT qh_reducevertices ( qhT * qh )

Definition at line 2924 of file merge_r.c.

◆ qh_redundant_vertex()

vertexT* qh_redundant_vertex	(	qhT *	qh,
		vertexT *	vertex
	)

Definition at line 2996 of file merge_r.c.

◆ qh_remove_extravertices()

boolT qh_remove_extravertices	(	qhT *	qh,
		facetT *	facet
	)

Definition at line 3028 of file merge_r.c.

◆ qh_rename_sharedvertex()

vertexT* qh_rename_sharedvertex	(	qhT *	qh,
		vertexT *	vertex,
		facetT *	facet
	)

Definition at line 3087 of file merge_r.c.

◆ qh_renameridgevertex()

void qh_renameridgevertex	(	qhT *	qh,
		ridgeT *	ridge,
		vertexT *	oldvertex,
		vertexT *	newvertex
	)

Definition at line 3150 of file merge_r.c.

◆ qh_renamevertex()

void qh_renamevertex	(	qhT *	qh,
		vertexT *	oldvertex,
		vertexT *	newvertex,
		setT *	ridges,
		facetT *	oldfacet,
		facetT *	neighborA
	)

Definition at line 3212 of file merge_r.c.

◆ qh_test_appendmerge()

boolT qh_test_appendmerge	(	qhT *	qh,
		facetT *	facet,
		facetT *	neighbor
	)

Definition at line 3292 of file merge_r.c.

◆ qh_test_vneighbors()

boolT qh_test_vneighbors ( qhT * qh )

Definition at line 3375 of file merge_r.c.

◆ qh_tracemerge()

void qh_tracemerge	(	qhT *	qh,
		facetT *	facet1,
		facetT *	facet2
	)

Definition at line 3411 of file merge_r.c.

◆ qh_tracemerging()

void qh_tracemerging ( qhT * qh )

Definition at line 3460 of file merge_r.c.

◆ qh_updatetested()

void qh_updatetested	(	qhT *	qh,
		facetT *	facet1,
		facetT *	facet2
	)

Definition at line 3502 of file merge_r.c.

◆ qh_vertexridges()

setT* qh_vertexridges	(	qhT *	qh,
		vertexT *	vertex
	)

Definition at line 3545 of file merge_r.c.

◆ qh_vertexridges_facet()

void qh_vertexridges_facet	(	qhT *	qh,
		vertexT *	vertex,
		facetT *	facet,
		setT **	ridges
	)

Definition at line 3586 of file merge_r.c.

◆ qh_willdelete()

void qh_willdelete	(	qhT *	qh,
		facetT *	facet,
		facetT *	replace
	)

Definition at line 3609 of file merge_r.c.

Functions