triangle.cpp File Reference

Go to the source code of this file.

Classes
struct	otri
struct	osub
struct	badsubseg
struct	badtriang
struct	flipstacker
struct	event
struct	splaynode
struct	memorypool
struct	mesh
struct	behavior

Typedefs
typedef REAL **	triangle
typedef REAL **	subseg
typedef REAL *	vertex

Enumerations
enum	locateresult { INTRIANGLE , ONEDGE , ONVERTEX , OUTSIDE }
enum	insertvertexresult { SUCCESSFULVERTEX , ENCROACHINGVERTEX , VIOLATINGVERTEX , DUPLICATEVERTEX }
enum	finddirectionresult { WITHIN , LEFTCOLLINEAR , RIGHTCOLLINEAR }

Functions
char *	readline ()
char *	findfield ()
int	triunsuitable ()
int	triunsuitable (vertex triorg, vertex tridest, vertex triapex, REAL) int triunsuitable(triorg
	if (maxlen > 0.05 *(triorg[0] *triorg[0]+triorg[1] *triorg[1])+0.02)
void	triexit (int status) void triexit(status) int status
VOID *	trimalloc (int size) VOID *trimalloc(size) int size
	if (memptr==(VOID *) NULL)
	return (memptr)
void	trifree (void *memptr) void trifree(memptr) VOID *memptr
void	syntax ()
void	info ()
void	internalerror ()
void	parsecommandline (int argc, const char **argv, struct behavior *b) void parsecommandline(argc
	for (i=STARTINDEX;i< argc;i++)
	if (b->innodefilename[0]=='\0')
	if (!strcmp(&b->innodefilename[strlen(b->innodefilename) - 5], ".node"))
	if (!strcmp(&b->innodefilename[strlen(b->innodefilename) - 5], ".poly"))
	if (!strcmp(&b->innodefilename[strlen(b->innodefilename) - 4], ".ele"))
	if (!strcmp(&b->innodefilename[strlen(b->innodefilename) - 5], ".area"))
	if (b->goodangle==1.0)
b goodangle *	if (b->refine &&b->noiterationnum)
	if (!b->refine &&!b->poly)
	if (b->refine||!b->poly)
	if (b->weighted &&(b->poly||b->quality))
	if (b->jettison &&b->nonodewritten &&!b->quiet)
	strcpy (b->inpolyfilename, b->innodefilename)
	strcpy (workstring, b->innodefilename)
	while (workstring[j] !='\0')
	if (increment > 0)
else	if (increment==0)
	sprintf (b->outnodefilename, workstring, meshnumber+1)
	strcat (b->outnodefilename, ".node")
	strcat (b->outpolyfilename, ".poly")
	strcat (b->outelefilename, ".ele")
	strcat (b->edgefilename, ".edge")
	strcat (b->vnodefilename, ".v.node")
	strcat (b->vedgefilename, ".v.edge")
	strcat (b->neighborfilename, ".neigh")
	strcat (b->offfilename, ".off")
	strcat (b->areafilename, ".area")
void	printtriangle (struct mesh *m, struct behavior *b, struct otri *t) void printtriangle(m
	printf ("triangle x%lx with orientation %d:\n",(unsigned long) t->tri, t->orient)
	decode (t->tri[0], printtri)
	if (printtri.tri==m->dummytri)
	decode (t->tri[1], printtri)
	decode (t->tri[2], printtri)
	if (printvertex==(vertex) NULL) printf(" Origin[%d]
called is pointed to *void	dummyinit (struct mesh *m, struct behavior *b, int trianglebytes, int subsegbytes) void dummyinit(m
void	initializevertexpool (struct mesh *m, struct behavior *b) void initializevertexpool(m
poolinit &	m (REAL)
void	initializetrisubpools (struct mesh *m, struct behavior *b) void initializetrisubpools(m
else	if (m->eextras+b->regionattrib > 0)
	if ((b->voronoi||b->neighbors) &&(trisize< int(6 *sizeof(triangle)+sizeof(int))))
poolinit &	m (2 *m->invertices - 2) > TRIPERBLOCK ?(2 *m->invertices - 2) :TRIPERBLOCK, 4
void	triangledealloc (struct mesh *m, triangle *dyingtriangle) void triangledealloc(m
pooldealloc &	m (VOID *) dyingtriangle
triangle *	triangletraverse (struct mesh *m) triangle *triangletraverse(m) struct mesh *m
	if (newtriangle==(triangle *) NULL)
	while (deadtri(newtriangle))
void	subsegdealloc (struct mesh *m, subseg *dyingsubseg) void subsegdealloc(m
subseg *	subsegtraverse (struct mesh *m) subseg *subsegtraverse(m) struct mesh *m
	if (newsubseg==(subseg *) NULL)
	while (deadsubseg(newsubseg))
void	vertexdealloc (struct mesh *m, vertex dyingvertex) void vertexdealloc(m
vertex	vertextraverse (struct mesh *m) vertex vertextraverse(m) struct mesh *m
	if (newvertex==(vertex) NULL)
	while (vertextype(newvertex)==DEADVERTEX)
void	badsubsegdealloc (struct mesh *m, struct badsubseg *dyingseg) void badsubsegdealloc(m
struct badsubseg *	badsubsegtraverse (struct mesh *m) struct badsubseg *badsubsegtraverse(m) struct mesh *m
	if (newseg==(struct badsubseg *) NULL)
	while (newseg->subsegorg==(vertex) NULL)
vertex	getvertex (struct mesh *m, struct behavior *b, int number) vertex getvertex(m
	if (current+m->vertices.itemsfirstblock<=number)
return	vertex (foundvertex+m->vertices.itembytes *(number - current))
void	triangledeinit (struct mesh *m, struct behavior *b) void triangledeinit(m
	trifree ((VOID *) m->dummytribase)
void	maketriangle (struct mesh *m, struct behavior *b, struct otri *newotri) void maketriangle(m
	for (i=0;i< m->eextras;i++)
void	makesubseg (struct mesh *m, struct osub *newsubseg) void makesubseg(m
void	exactinit ()
int	fast_expansion_sum_zeroelim (int elen, REAL *e, int flen, REAL *f, REAL *h) int fast_expansion_sum_zeroelim(elen
	if ((fnow > enow)==(fnow > -enow))
	if ((eindex< elen) &&(findex< flen))
	while (eindex< elen)
	if ((Q !=0.0)||(hindex==0))
int	scale_expansion_zeroelim (int elen, REAL *e, REAL b, REAL *h) int scale_expansion_zeroelim(elen
	Split (b, bhi, blo)
	Two_Product_Presplit (e[0], b, bhi, blo, Q, hh)
	if (hh !=0)
REAL	estimate (int elen, REAL *e) REAL estimate(elen
REAL	counterclockwiseadapt (vertex pa, vertex pb, vertex pc, REAL detsum) REAL counterclockwiseadapt(pa
	Two_Product (acx, bcy, detleft, detlefttail)
	Two_Product (acy, bcx, detright, detrighttail)
	Two_Two_Diff (detleft, detlefttail, detright, detrighttail, B3, B[2], B[1], B[0])
	if ((det >=errbound)||(-det >=errbound))
	Two_Diff_Tail (pa[0], pc[0], acx, acxtail)
	Two_Diff_Tail (pb[0], pc[0], bcx, bcxtail)
	Two_Diff_Tail (pa[1], pc[1], acy, acytail)
	Two_Diff_Tail (pb[1], pc[1], bcy, bcytail)
	if ((acxtail==0.0) &&(acytail==0.0) &&(bcxtail==0.0) &&(bcytail==0.0))
	Two_Product (acxtail, bcy, s1, s0)
	Two_Product (acytail, bcx, t1, t0)
	Two_Two_Diff (s1, s0, t1, t0, u3, u[2], u[1], u[0])
	Two_Product (acx, bcytail, s1, s0)
	Two_Product (acy, bcxtail, t1, t0)
	Two_Product (acxtail, bcytail, s1, s0)
	Two_Product (acytail, bcxtail, t1, t0)
	return (D[Dlength - 1])
REAL	counterclockwise (struct mesh *m, struct behavior *b, vertex pa, vertex pb, vertex pc) REAL counterclockwise(m
	if (detleft > 0.0)
else	if (detleft< 0.0)
return	counterclockwiseadapt (pa, pb, pc, detsum)
REAL	incircleadapt (vertex pa, vertex pb, vertex pc, vertex pd, REAL permanent) REAL incircleadapt(pa
	Two_Product (bdx, cdy, bdxcdy1, bdxcdy0)
	Two_Product (cdx, bdy, cdxbdy1, cdxbdy0)
	Two_Two_Diff (bdxcdy1, bdxcdy0, cdxbdy1, cdxbdy0, bc3, bc[2], bc[1], bc[0])
	Two_Product (cdx, ady, cdxady1, cdxady0)
	Two_Product (adx, cdy, adxcdy1, adxcdy0)
	Two_Two_Diff (cdxady1, cdxady0, adxcdy1, adxcdy0, ca3, ca[2], ca[1], ca[0])
	Two_Product (adx, bdy, adxbdy1, adxbdy0)
	Two_Product (bdx, ady, bdxady1, bdxady0)
	Two_Two_Diff (adxbdy1, adxbdy0, bdxady1, bdxady0, ab3, ab[2], ab[1], ab[0])
	Two_Diff_Tail (pa[0], pd[0], adx, adxtail)
	Two_Diff_Tail (pa[1], pd[1], ady, adytail)
	Two_Diff_Tail (pb[0], pd[0], bdx, bdxtail)
	Two_Diff_Tail (pb[1], pd[1], bdy, bdytail)
	Two_Diff_Tail (pc[0], pd[0], cdx, cdxtail)
	Two_Diff_Tail (pc[1], pd[1], cdy, cdytail)
	if ((adxtail==0.0) &&(bdxtail==0.0) &&(cdxtail==0.0) &&(adytail==0.0) &&(bdytail==0.0) &&(cdytail==0.0))
	if ((bdxtail !=0.0)||(bdytail !=0.0)||(cdxtail !=0.0)||(cdytail !=0.0))
	if ((cdxtail !=0.0)||(cdytail !=0.0)||(adxtail !=0.0)||(adytail !=0.0))
	if ((adxtail !=0.0)||(adytail !=0.0)||(bdxtail !=0.0)||(bdytail !=0.0))
	if (adxtail !=0.0)
	if (adytail !=0.0)
	if (bdxtail !=0.0)
	if (bdytail !=0.0)
	if (cdxtail !=0.0)
	if (cdytail !=0.0)
	if ((adxtail !=0.0)||(adytail !=0.0))
	if ((bdxtail !=0.0)||(bdytail !=0.0))
	if ((cdxtail !=0.0)||(cdytail !=0.0))
REAL	incircle (struct mesh *m, struct behavior *b, vertex pa, vertex pb, vertex pc, vertex pd) REAL incircle(m
	if ((det > errbound)||(-det > errbound))
return	incircleadapt (pa, pb, pc, pd, permanent)
REAL	orient3dadapt (vertex pa, vertex pb, vertex pc, vertex pd, REAL aheight, REAL bheight, REAL cheight, REAL dheight, REAL permanent) REAL orient3dadapt(pa
	Two_Diff_Tail (aheight, dheight, adheight, adheighttail)
	Two_Diff_Tail (bheight, dheight, bdheight, bdheighttail)
	Two_Diff_Tail (cheight, dheight, cdheight, cdheighttail)
	if ((adxtail==0.0) &&(bdxtail==0.0) &&(cdxtail==0.0) &&(adytail==0.0) &&(bdytail==0.0) &&(cdytail==0.0) &&(adheighttail==0.0) &&(bdheighttail==0.0) &&(cdheighttail==0.0))
	if (adxtail==0.0)
	if (adheighttail !=0.0)
	if (bdheighttail !=0.0)
	if (cdheighttail !=0.0)
REAL	orient3d (struct mesh *m, struct behavior *b, vertex pa, vertex pb, vertex pc, vertex pd, REAL aheight, REAL bheight, REAL cheight, REAL dheight) REAL orient3d(m
return	orient3dadapt (pa, pb, pc, pd, aheight, bheight, cheight, dheight, permanent)
REAL	nonregular (struct mesh *m, struct behavior *b, vertex pa, vertex pb, vertex pc, vertex pd) REAL nonregular(m
	if ((dodist< aodist) &&(dodist< dadist))
void	triangleinit (struct mesh *m) void triangleinit(m) struct mesh *m
unsigned long	randomnation (unsigned int choices) unsigned long randomnation(choices) unsigned int choices
return	randomseed (714025l/choices+1)
void	checkmesh (struct mesh *m, struct behavior *b) void checkmesh(m
	if (!b->quiet)
	while (triangleloop.tri !=(triangle *) NULL)
	if (horrors==0)
void	checkdelaunay (struct mesh *m, struct behavior *b) void checkdelaunay(m
void	enqueuebadtriang (struct mesh *m, struct behavior *b, struct badtriang *badtri) void enqueuebadtriang(m
	if (b->verbose > 2)
	if (badtri->key >=1.0)
	while (length > 2.0)
	if (posexponent)
	if (m->queuefront[queuenumber]==(struct badtriang *) NULL)
void	enqueuebadtri (struct mesh *m, struct behavior *b, struct otri *enqtri, REAL minedge, vertex enqapex, vertex enqorg, vertex enqdest) void enqueuebadtri(m
	enqueuebadtriang (m, b, newbad)
struct badtriang *	dequeuebadtriang (struct mesh *m) struct badtriang *dequeuebadtriang(m) struct mesh *m
	if (result==m->queuetail[m->firstnonemptyq])
int	checkseg4encroach (struct mesh *m, struct behavior *b, struct osub *testsubseg) int checkseg4encroach(m
	if (neighbortri.tri !=m->dummytri)
	stpivot (testsym, neighbortri)
	if (encroached &&(!b->nobisect||((b->nobisect==1) &&(sides==2))))
void	testtriangle (struct mesh *m, struct behavior *b, struct otri *testtri) void testtriangle(m
	if ((apexlen< orglen) &&(apexlen< destlen))
	if (b->vararea||b->fixedarea||b->usertest)
	if (angle > b->goodangle)
void	makevertexmap (struct mesh *m, struct behavior *b) void makevertexmap(m
enum locateresult	preciselocate (struct mesh *m, struct behavior *b, vertex searchpoint, struct otri *searchtri, int stopatsubsegment) enum locateresult preciselocate(m
	while (1)
enum locateresult	locate (struct mesh *m, struct behavior *b, vertex searchpoint, struct otri *searchtri) enum locateresult locate(m
	if (m->recenttri.tri !=(triangle *) NULL)
	while (SAMPLEFACTOR *m->samples *m->samples *m->samples< m->triangles.items)
	while (totalsamplesleft > 0)
	if ((torg[0]==searchpoint[0]) &&(torg[1]==searchpoint[1]))
	if ((tdest[0]==searchpoint[0]) &&(tdest[1]==searchpoint[1]))
else	if (ahead==0.0)
return	preciselocate (m, b, searchpoint, searchtri, 0)
void	insertsubseg (struct mesh *m, struct behavior *b, struct otri *tri, int subsegmark) void insertsubseg(m
	if (vertexmark(triorg)==0)
	if (vertexmark(tridest)==0)
	if (newsubseg.ss==m->dummysub)
	if (top.tri==m->dummytri)
	if (m->checksegments)
	apex (top, farvertex)
	lprev (top, topleft)
	sym (topleft, toplcasing)
	lnext (top, topright)
	sym (topright, toprcasing)
	sym (botleft, botlcasing)
	sym (botright, botrcasing)
	bond (topleft, botlcasing)
	bond (botleft, botrcasing)
	bond (botright, toprcasing)
	bond (topright, toplcasing)
	setorg (top, botvertex)
	setdest (top, farvertex)
	setapex (top, leftvertex)
void	unflip (struct mesh *m, struct behavior *b, struct otri *flipedge) void unflip(m
	bond (topleft, toprcasing)
	bond (botleft, toplcasing)
	bond (botright, botlcasing)
	bond (topright, botrcasing)
	setorg (top, farvertex)
	setdest (top, botvertex)
	setapex (top, rightvertex)
enum insertvertexresult	insertvertex (struct mesh *m, struct behavior *b, vertex newvertex, struct otri *searchtri, struct osub *splitseg, int segmentflaws, int triflaws) enum insertvertexresult insertvertex(m
	if (b->verbose > 1)
	if (splitseg==(struct osub *) NULL)
	if (intersect==ONVERTEX)
	if ((intersect==ONEDGE)||(intersect==OUTSIDE))
	lprev (horiz, botright)
	maketriangle (m, b, &newbotleft)
	org (horiz, rightvertex)
	destT (horiz, leftvertex)
	apex (horiz, botvertex)
	setorg (newbotleft, leftvertex)
	setdest (newbotleft, botvertex)
	setapex (newbotleft, newvertex)
	setorg (newbotright, botvertex)
	setdest (newbotright, rightvertex)
	setapex (newbotright, newvertex)
	setapex (horiz, newvertex)
	bond (newbotleft, botlcasing)
	bond (newbotright, botrcasing)
	lnextself (newbotleft)
	lprevself (newbotright)
	bond (newbotleft, newbotright)
	bond (botleft, newbotleft)
	bond (botright, newbotright)
	org (horiz, first)
void	triangulatepolygon (struct mesh *m, struct behavior *b, struct otri *firstedge, struct otri *lastedge, int edgecount, int doflip, int triflaws) void triangulatepolygon(m
	destT (besttri, bestvertex)
	otricopy (besttri, testtri)
	if (bestnumber > 1)
	if (doflip)
	otricopy (besttri, *lastedge)
void	deletevertex (struct mesh *m, struct behavior *b, struct otri *deltri) void deletevertex(m
	vertexdealloc (m, delvertex)
	while (!otriequal(*deltri, countingtri))
	if (edgecount > 3)
	sym (lefttri, leftcasing)
	oprev (deltriright, righttri)
	sym (righttri, rightcasing)
	bond (deltriright, rightcasing)
	tspivot (lefttri, leftsubseg)
	if (leftsubseg.ss !=m->dummysub)
	tspivot (righttri, rightsubseg)
	if (rightsubseg.ss !=m->dummysub)
	org (lefttri, neworg)
	triangledealloc (m, lefttri.tri)
	triangledealloc (m, righttri.tri)
void	undovertex (struct mesh *m, struct behavior *b) void undovertex(m
	while (m->lastflip !=(struct flipstacker *) NULL)
void	vertexsort (vertex *sortarray, int arraysize) void vertexsort(sortarray
	if (arraysize==2)
	if (left > 1)
void	vertexmedian (vertex *sortarray, int arraysize, int median, int axis) void vertexmedian(sortarray
	if (left > median)
void	alternateaxes (vertex *sortarray, int arraysize, int axis) void alternateaxes(sortarray
	if (arraysize<=3)
	vertexmedian (sortarray, arraysize, divider, axis)
	if (arraysize - divider >=2)
void	mergehulls (struct mesh *m, struct behavior *b, struct otri *farleft, struct otri *innerleft, struct otri *innerright, struct otri *farright, int axis) void mergehulls(m
	if (b->dwyer &&(axis==1))
	if (counterclockwise(m, b, innerleftdest, innerleftapex, innerrightorg) > 0.0)
	if (counterclockwise(m, b, innerrightapex, innerrightorg, innerleftdest) > 0.0)
	while (changemade)
	bond (baseedge, *innerleft)
	lnextself (baseedge)
	setorg (baseedge, innerrightorg)
	setdest (baseedge, innerleftdest)
	if (innerleftdest==farleftpt)
	if (innerrightorg==farrightpt)
	apex (leftcand, upperleft)
	apex (rightcand, upperright)
void	divconqrecurse (struct mesh *m, struct behavior *b, vertex *sortarray, int vertices, int axis, struct otri *farleft, struct otri *farright) void divconqrecurse(m
	if (vertices==2)
	divconqrecurse (m, b, sortarray, divider, 1 - axis, farleft, &innerleft)
	divconqrecurse (m, b, &sortarray[divider], vertices - divider, 1 - axis, &innerright, farright)
	mergehulls (m, b, farleft, &innerleft, &innerright, farright, axis)
long	removeghosts (struct mesh *m, struct behavior *b, struct otri *startghost) long removeghosts(m
	symself (searchedge)
	lnext (dissolveedge, deadtriangle)
	lprevself (dissolveedge)
	symself (dissolveedge)
	dissolve (dissolveedge)
	sym (deadtriangle, dissolveedge)
	triangledealloc (m, deadtriangle.tri)
	while (!otriequal(dissolveedge, *startghost))
long	divconqdelaunay (struct mesh *m, struct behavior *b) long divconqdelaunay(m
	vertexsort (sortarray, m->invertices)
	for (j=1;j< m->invertices;j++)
	divconqrecurse (m, b, sortarray, i, 0, &hullleft, &hullright)
	trifree ((VOID *) sortarray)
return	removeghosts (m, b, &hullleft)
void	boundingbox (struct mesh *m, struct behavior *b) void boundingbox(m
	if (m->ymax - m->ymin > width)
	if (width==0.0)
	setorg (inftri, m->infvertex1)
	setdest (inftri, m->infvertex2)
	setapex (inftri, m->infvertex3)
long	removebox (struct mesh *m, struct behavior *b) long removebox(m
	symself (nextedge)
	lprev (nextedge, finaledge)
	lnextself (nextedge)
	lprev (nextedge, searchedge)
	lnext (nextedge, checkedge)
	symself (checkedge)
	if (checkedge.tri==m->dummytri)
	while (!otriequal(nextedge, finaledge))
	triangledealloc (m, finaledge.tri)
long	incrementaldelaunay (struct mesh *m, struct behavior *b) long incrementaldelaunay(m
	boundingbox (m, b)
	while (vertexloop !=(vertex) NULL)
return	removebox (m, b)
void	eventheapinsert (struct event **heap, int heapsize, struct event *newevent) void eventheapinsert(heap
	while (notdone)
void	eventheapify (struct event **heap, int heapsize, int eventnum) void eventheapify(heap
void	eventheapdelete (struct event **heap, int heapsize, int eventnum) void eventheapdelete(heap
	if (eventnum > 0)
	eventheapify (heap, heapsize - 1, eventnum)
void	createeventheap (struct mesh *m, struct event ***eventheap, struct event **events, struct event **freeevents) void createeventheap(m
int	rightofhyperbola (struct mesh *m, struct otri *fronttri, vertex newsite) int rightofhyperbola(m
	if ((leftvertex[1]< rightvertex[1])||((leftvertex[1]==rightvertex[1]) &&(leftvertex[0]< rightvertex[0])))
REAL	circletop (struct mesh *m, vertex pa, vertex pb, vertex pc, REAL ccwabc) REAL circletop(m
return	pc (xac *bclen2 - xbc *aclen2+sqrt(aclen2 *bclen2 *ablen2))/(2.0 *ccwabc)
void	check4deadevent (struct otri *checktri, struct event **freeevents, struct event **eventheap, int *heapsize) void check4deadevent(checktri
	if (eventvertex !=(vertex) NULL)
struct splaynode *	splay (struct mesh *m, struct splaynode *splaytree, vertex searchpoint, struct otri *searchtri) struct splaynode *splay(m
	if (splaytree==(struct splaynode *) NULL)
	destT (splaytree->keyedge, checkvertex)
	if (checkvertex==splaytree->keydest)
	if (lefttree==(struct splaynode *) NULL)
else	if (righttree==(struct splaynode *) NULL)
else	if (lefttree->rchild==(struct splaynode *) NULL)
else	if (righttree->lchild==(struct splaynode *) NULL)
	while (leftright->rchild !=(struct splaynode *) NULL)
struct splaynode *	splayinsert (struct mesh *m, struct splaynode *splayroot, struct otri *newkey, vertex searchpoint) struct splaynode *splayinsert(m
	if (splayroot==(struct splaynode *) NULL)
else	if (rightofhyperbola(m, &splayroot->keyedge, searchpoint))
struct splaynode *	circletopinsert (struct mesh *m, struct behavior *b, struct splaynode *splayroot, struct otri *newkey, vertex pa, vertex pb, vertex pc, REAL topy) struct splaynode *circletopinsert(m
return	splayinsert (m, splay(m, splayroot,(vertex) searchpoint, &dummytri), newkey,(vertex) searchpoint)
struct splaynode *	frontlocate (struct mesh *m, struct splaynode *splayroot, struct otri *bottommost, vertex searchvertex, struct otri *searchtri, int *farright) struct splaynode *frontlocate(m
	while (!farrightflag &&rightofhyperbola(m, searchtri, searchvertex))
long	sweeplinedelaunay (struct mesh *m, struct behavior *b) long sweeplinedelaunay(m
poolinit &	m (struct splaynode), SPLAYNODEPERBLOCK, SPLAYNODEPERBLOCK, 0
	createeventheap (m, &eventheap, &events, &freeevents)
	bond (lefttri, righttri)
	lnextself (lefttri)
	lprevself (righttri)
	eventheapdelete (eventheap, heapsize, 0)
	if ((firstvertex[0]==secondvertex[0]) &&(firstvertex[1]==secondvertex[1]))
	while ((firstvertex[0]==secondvertex[0]) &&(firstvertex[1]==secondvertex[1]))
	setorg (lefttri, firstvertex)
	setdest (lefttri, secondvertex)
	setorg (righttri, secondvertex)
	setdest (righttri, firstvertex)
	lprev (lefttri, bottommost)
	while (heapsize > 0)
	lprevself (bottommost)
long	delaunay (struct mesh *m, struct behavior *b) long delaunay(m
	initializetrisubpools (m, b)
	if (m->triangles.items==0)
int	reconstruct (struct mesh *m, struct behavior *b, int *trianglelist, REAL *triangleattriblist, REAL *trianglearealist, int elements, int corners, int attribs, int *segmentlist, int *segmentmarkerlist, int numberofsegments) int reconstruct(m
long	reconstruct (struct mesh *m, struct behavior *b, char *elefilename, char *areafilename, char *polyfilename, FILE *polyfile) long reconstruct(m
	if (elefile==(FILE *) NULL)
	for (elementnumber=1;elementnumber<=m->inelements;elementnumber++)
	fclose (elefile)
enum finddirectionresult	finddirection (struct mesh *m, struct behavior *b, struct otri *searchtri, vertex searchpoint) enum finddirectionresult finddirection(m
	if (leftflag &&rightflag)
	while (leftflag)
	while (rightflag)
	if (leftccw==0.0)
else	if (rightccw==0.0)
void	segmentintersection (struct mesh *m, struct behavior *b, struct otri *splittri, struct osub *splitsubseg, vertex endpoint2) void segmentintersection(m
	if (denom==0.0)
	setvertexmark (newvertex, markT(*splitsubseg))
	setvertextype (newvertex, INPUTVERTEX)
	if (success !=SUCCESSFULVERTEX)
	setvertex2tri (newvertex, encode(*splittri))
	if (m->steinerleft > 0)
	sdissolve (opposubseg)
	while (splitsubseg->ss !=m->dummysub)
	snextself (opposubseg)
	while (opposubseg.ss !=m->dummysub)
	if ((leftvertex[0]==endpoint1[0]) &&(leftvertex[1]==endpoint1[1]))
else	if ((rightvertex[0] !=endpoint1[0])||(rightvertex[1] !=endpoint1[1]))
int	scoutsegment (struct mesh *m, struct behavior *b, struct otri *searchtri, vertex endpoint2, int newmark) int scoutsegment(m
	if (((leftvertex[0]==endpoint2[0]) &&(leftvertex[1]==endpoint2[1]))||((rightvertex[0]==endpoint2[0]) &&(rightvertex[1]==endpoint2[1])))
else	if (collinear==LEFTCOLLINEAR)
	tspivot (crosstri, crosssubseg)
	if (crosssubseg.ss==m->dummysub)
	otricopy (crosstri, *searchtri)
	insertsubseg (m, b, searchtri, newmark)
return	scoutsegment (m, b, searchtri, endpoint2, newmark)
void	conformingedge (struct mesh *m, struct behavior *b, vertex endpoint1, vertex endpoint2, int newmark) void conformingedge(m
	setvertexmark (newvertex, newmark)
	setvertextype (newvertex, SEGMENTVERTEX)
	if (success==DUPLICATEVERTEX)
	finddirection (m, b, &searchtri2, endpoint2)
	if (!scoutsegment(m, b, &searchtri1, endpoint1, newmark))
	if (!scoutsegment(m, b, &searchtri2, endpoint2, newmark))
void	delaunayfixup (struct mesh *m, struct behavior *b, struct otri *fixuptri, int leftside) void delaunayfixup(m
	sym (neartri, fartri)
	if (fartri.tri==m->dummytri)
	tspivot (neartri, faredge)
	if (faredge.ss !=m->dummysub)
	apex (neartri, nearvertex)
	org (neartri, leftvertex)
	destT (neartri, rightvertex)
	apex (fartri, farvertex)
	if (leftside)
	delaunayfixup (m, b, fixuptri, leftside)
	delaunayfixup (m, b, &fartri, leftside)
void	constrainededge (struct mesh *m, struct behavior *b, struct otri *starttri, vertex endpoint2, int newmark) void const rainededge(m
	flip (m, b, &fixuptri)
	if ((farvertex[0]==endpoint2[0]) &&(farvertex[1]==endpoint2[1]))
	if (area==0.0)
	segmentintersection (m, b, &fixuptri, &crosssubseg, endpoint2)
	while (!done)
	insertsubseg (m, b, &fixuptri, newmark)
	if (collision)
void	insertsegment (struct mesh *m, struct behavior *b, vertex endpoint1, vertex endpoint2, int newmark) void insertsegment(m
	if (encodedtri !=(triangle) NULL)
	if (checkvertex !=endpoint1)
	otricopy (searchtri1, m->recenttri)
	if (scoutsegment(m, b, &searchtri1, endpoint2, newmark))
	org (searchtri1, endpoint1)
	otricopy (searchtri2, m->recenttri)
	if (scoutsegment(m, b, &searchtri2, endpoint1, newmark))
	org (searchtri2, endpoint2)
void	markhull (struct mesh *m, struct behavior *b) void markhull(m
	symself (hulltri)
	otricopy (hulltri, starttri)
	lnextself (hulltri)
	oprev (hulltri, nexttri)
	while (nexttri.tri !=m->dummytri)
	while (!otriequal(hulltri, starttri))
void	formskeleton (struct mesh *m, struct behavior *b, int *segmentlist, int *segmentmarkerlist, int numberofsegments) void formskeleton(m
void	formskeleton (struct mesh *m, struct behavior *b, FILE *polyfile, char *polyfilename) void formskeleton(m
	if (b->convex||!b->poly)
void	infecthull (struct mesh *m, struct behavior *b) void infecthull(m
void	plague (struct mesh *m, struct behavior *b) void plague(m
	while (virusloop !=(triangle **) NULL)
void	regionplague (struct mesh *m, struct behavior *b, REAL attribute, REAL area) void regionplague(m
void	carveholes (struct mesh *m, struct behavior *b, REAL *holelist, int holes, REAL *regionlist, int regions) void carveholes(m
	if (!(b->quiet||(b->noholes &&b->convex)))
	if (regions > 0)
	if (((holes > 0) &&!b->noholes)||!b->convex||(regions > 0))
	if ((holes > 0) &&!b->noholes)
	if (m->viri.items > 0)
void	tallyencs (struct mesh *m, struct behavior *b) void tallyencs(m
	while (subsegloop.ss !=(subseg *) NULL)
void	precisionerror ()
void	splitencsegs (struct mesh *m, struct behavior *b, int triflaws) void splitencsegs(m
	while ((m->badsubsegs.items > 0) &&(m->steinerleft !=0))
void	tallyfaces (struct mesh *m, struct behavior *b) void tallyfaces(m
void	splittriangle (struct mesh *m, struct behavior *b, struct badtriang *badtri) void splittriangle(m
	decode (badtri->poortri, badotri)
	org (badotri, borg)
	destT (badotri, bdest)
	apex (badotri, bapex)
	if (!deadtri(badotri.tri) &&(borg==badtri->triangorg) &&(bdest==badtri->triangdest) &&(bapex==badtri->triangapex))
void	enforcequality (struct mesh *m, struct behavior *b) void enforcequality(m
poolinit &	m (struct badsubseg), BADSUBSEGPERBLOCK, BADSUBSEGPERBLOCK, 0
	tallyencs (m, b)
	if (b->verbose &&(m->badsubsegs.items > 0))
	splitencsegs (m, b, 0)
	if ((b->minangle > 0.0)||b->vararea||b->fixedarea||b->usertest)
	if (!b->quiet &&b->conformdel &&(m->badsubsegs.items > 0) &&(m->steinerleft==0))
void	highorder (struct mesh *m, struct behavior *b) void highorder(m
char *	readline (char *string, FILE *infile, char *infilename) char *readline(string
	while ((*result !='\0') &&(*result !='#') &&(*result !='.') &&(*result !='+') &&(*result !='-') &&((*result< '0')||(*result > '9')))
	while ((*result=='#')||(*result=='\0'))
char *	findfield (char *string) char *findfield(string) char *string
	while ((*result !='\0') &&(*result !='#') &&(*result !=' ') &&(*result !='\t'))
void	readnodes (struct mesh *m, struct behavior *b, char *nodefilename, char *polyfilename, FILE **polyfile) void readnodes(m
	if (m->mesh_dim !=2)
	initializevertexpool (m, b)
void	transfernodes (struct mesh *m, struct behavior *b, REAL *pointlist, REAL *pointattriblist, int *pointmarkerlist, int numberofpoints, int numberofpointattribs) void transfernodes(m
void	readholes (struct mesh *m, struct behavior *b, FILE *polyfile, char *polyfilename, REAL **hlist, int *holes, REAL **rlist, int *regions) void readholes(m
	if ((b->regionattrib||b->vararea) &&!b->refine)
	fclose (polyfile)
void	finishfile (FILE *outfile, int argc, char **argv) void finishfile(outfile
	fprintf (outfile, "# Generated by")
	fprintf (outfile, "\n")
	fclose (outfile)
void	writenodes (struct mesh *m, struct behavior *b, REAL **pointlist, REAL **pointattriblist, int **pointmarkerlist) void writenodes(m
void	writenodes (struct mesh *m, struct behavior *b, char *nodefilename, int argc, char **argv) void writenodes(m
if *	pointlist (REAL *) NULL
	if ((m->nextras > 0) &&(*pointattriblist==(REAL *) NULL))
	if (!b->nobound &&(*pointmarkerlist==(int *) NULL))
	if (outfile==(FILE *) NULL)
	fprintf (outfile, "%ld %d %d %d\n", outvertices, m->mesh_dim, m->nextras, 1 - b->nobound)
	finishfile (outfile, argc, argv)
void	numbernodes (struct mesh *m, struct behavior *b) void numbernodes(m
void	writeelements (struct mesh *m, struct behavior *b, int **trianglelist, REAL **triangleattriblist) void writeelements(m
void	writeelements (struct mesh *m, struct behavior *b, char *elefilename, int argc, char **argv) void writeelements(m
if *	trianglelist (int *) NULL
	if ((m->eextras > 0) &&(*triangleattriblist==(REAL *) NULL))
	fprintf (outfile, "%ld %d %d\n", m->triangles.items,(b->order+1) *(b->order+2)/2, m->eextras)
void	writepoly (struct mesh *m, struct behavior *b, int **segmentlist, int **segmentmarkerlist) void writepoly(m
void	writepoly (struct mesh *m, struct behavior *b, char *polyfilename, REAL *holelist, int holes, REAL *regionlist, int regions, int argc, char **argv) void writepoly(m
if *	segmentlist (int *) NULL
	fprintf (outfile, "%d %d %d %d\n", 0, m->mesh_dim, m->nextras, 1 - b->nobound)
	fprintf (outfile, "%ld %d\n", m->subsegs.items, 1 - b->nobound)
	fprintf (outfile, "%d\n", holes)
	if (holes > 0)
void	writeedges (struct mesh *m, struct behavior *b, int **edgelist, int **edgemarkerlist) void writeedges(m
void	writeedges (struct mesh *m, struct behavior *b, char *edgefilename, int argc, char **argv) void writeedges(m
if *	edgelist (int *) NULL
	fprintf (outfile, "%ld %d\n", m->edges, 1 - b->nobound)
void	writevoronoi (struct mesh *m, struct behavior *b, REAL **vpointlist, REAL **vpointattriblist, int **vpointmarkerlist, int **vedgelist, int **vedgemarkerlist, REAL **vnormlist) void writevoronoi(m
void	writevoronoi (struct mesh *m, struct behavior *b, char *vnodefilename, char *vedgefilename, int argc, char **argv) void writevoronoi(m
if *	vpointlist (REAL *) NULL
if *	vpointattriblist (REAL *) NULL
	fprintf (outfile, "%ld %d %d %d\n", m->triangles.items, 2, m->nextras, 0)
if *	vedgelist (int *) NULL
if *	vnormlist (REAL *) NULL
	fprintf (outfile, "%ld %d\n", m->edges, 0)
void	writeneighbors (struct mesh *m, struct behavior *b, int **neighborlist) void writeneighbors(m
void	writeneighbors (struct mesh *m, struct behavior *b, char *neighborfilename, int argc, char **argv) void writeneighbors(m
if *	neighborlist (int *) NULL
	fprintf (outfile, "%ld %d\n", m->triangles.items, 3)
void	writeoff (struct mesh *m, struct behavior *b, char *offfilename, int argc, char **argv) void writeoff(m
	fprintf (outfile, "OFF\n%ld %ld %ld\n", outvertices, m->triangles.items, m->edges)
void	quality_statistics (struct mesh *m, struct behavior *b) void quality_statistics(m
	printf ("Mesh quality statistics:\n\n")
smallestarea *biggestarea *	if (smallestangle >=1.0)
	if (biggestangle >=1.0)
	printf (" Shortest edge: %16.5g | Longest edge: %16.5g\n", shortest, longest)
	printf (" Shortest altitude: %12.5g | Largest aspect ratio: %8.5g\n\n", minaltitude, worstaspect)
	printf (" Triangle aspect ratio histogram:\n")
	printf (" 1.1547 - %-6.6g : %8d | %6.6g - %-6.6g : %8d\n", ratiotable[0], aspecttable[0], ratiotable[7], ratiotable[8], aspecttable[8])
	printf (" %6.6g - %-6.6g : %8d | %6.6g - : %8d\n", ratiotable[6], ratiotable[7], aspecttable[7], ratiotable[14], aspecttable[15])
	printf (" (Aspect ratio is longest edge divided by shortest altitude)\n\n")
	printf (" Smallest angle: %15.5g | Largest angle: %15.5g\n\n", smallestangle, biggestangle)
	printf (" Angle histogram:\n")
	printf ("\n")
void	statistics (struct mesh *m, struct behavior *b) void statistics(m
	printf (" Input vertices: %d\n", m->invertices)
	printf ("\n Mesh vertices: %ld\n", m->vertices.items - m->undeads)
	printf (" Mesh triangles: %ld\n", m->triangles.items)
	printf (" Mesh edges: %ld\n", m->edges)
	printf (" Mesh exterior boundary edges: %ld\n", m->hullsize)
	if (b->poly||b->refine)
void	triangulate (const char *triswitches, struct triangulateio *in, struct triangulateio *out, struct triangulateio *vorout) void triangulate(triswitches
int	main (int argc, char **argv) int main(argc
	parsecommandline (1, &triswitches, &b)
	parsecommandline (argc, argv, &b)
	if (!b.quiet)
	if (b.refine)
	if (b.poly &&(m.triangles.items > 0))
	if (b.quality &&(m.triangles.items > 0))
	if (b.order > 1)
	if (vorout !=(struct triangulateio *) NULL)
	if (b.nonodewritten||(b.noiterationnum &&m.readnodefile))
	if (b.poly||b.convex)
	if (m.regions > 0)

Variables
REAL	splitter
REAL	epsilon
REAL	resulterrbound
REAL	ccwerrboundA
REAL	ccwerrboundB
REAL	ccwerrboundC
REAL	iccerrboundA
REAL	iccerrboundB
REAL	iccerrboundC
REAL	o3derrboundA
REAL	o3derrboundB
REAL	o3derrboundC
unsigned long	randomseed = 1
int	plus1mod3 [3] = {1, 2, 0}
int	minus1mod3 [3] = {2, 0, 1}
int	tridest
int	triapex
int area vertex	triorg
REAL	area
REAL	dyoa
REAL	dyda = tridest[1] - triapex[1]
REAL	dyod = triorg[1] - tridest[1]
REAL	oalen = dxoa * dxoa + dyoa * dyoa
REAL	dalen = dxda * dxda + dyda * dyda
REAL	odlen = dxod * dxod + dyod * dyod
REAL	maxlen = (dalen > oalen) ? dalen : oalen
	dxoa = triorg[0] - triapex[0]
	dxda = tridest[0] - triapex[0]
	dxod = triorg[0] - tridest[0]
	else
	memptr = (VOID *) malloc((unsigned int) size)
void	argv
void b int	argc
struct behavior *	b
int	meshnumber
int	i = 0
int	j = 1
int	k
char	workstring [FILENAMESIZE] = 'd'
b	poly = b->refine = b->quality = 0
b	vararea = b->fixedarea = b->usertest = 0
b	regionattrib = b->convex = b->weighted = b->jettison = 0
b	firstnumber = 1
b	edgesout = b->voronoi = b->neighbors = b->geomview = 0
b	nobound = b->nopolywritten = b->nonodewritten = b->noelewritten = 0
b	noiterationnum = 0
b	noholes = b->noexact = 0
b	incremental = b->sweepline = 0
b	dwyer = 1
b	splitseg = 0
b	docheck = 0
b	nobisect = 0
b	conformdel = 0
b	steiner = -1
b	order = 1
b	minangle = 0.0
b	maxarea = -1.0
b	quiet = b->verbose = 0
b	innodefilename [0] = '\0'
b	usesegments = b->poly || b->refine || b->quality || b->convex
b	goodangle = cos(b->minangle * PI / 180.0)
	increment = 0
void t struct mesh *	m
struct otri *	t
struct osub	printsh
vertex	printvertex
called	dummytri
called is pointed to *void	trianglebytes
int	subsegbytes
m	dummytribase
	alignptr = (unsigned long) m->dummytribase
m	vertexmarkindex
	vertexsize = (m->vertexmarkindex + 2) * sizeof(int)
m	highorderindex = 6 + (b->usesegments * 3)
	trisize
m	elemattribindex = (trisize + sizeof(REAL) - 1) / sizeof(REAL)
m	areaboundindex = m->elemattribindex + m->eextras + b->regionattrib
triangle *	dyingtriangle
	do
return	newtriangle
subseg *	dyingsubseg
return	newsubseg
vertex	dyingvertex
return	newvertex = (vertex) poolalloc(&m->vertices)
struct badsubseg *	dyingseg
return	newseg
int	number
char *	foundvertex
int	current = b->firstnumber
	getblock = m->vertices.firstblock
struct otri *	newotri
newotri	tri = (triangle *) poolalloc(&m->triangles)
newotri	orient = 0
newsubseg	ss [0] = (subseg) m->dummysub
newsubseg	ssorient = 0
int	e
int	flen
int	f
int h int	elen
REAL *	h
INEXACT REAL	Qnew
INEXACT REAL	hh
INEXACT REAL	bvirt
REAL	avirt
REAL	bround
REAL	around
int	eindex = findex = 0
int	findex
int	hindex = 0
REAL	enow = e[0]
REAL	fnow = f[0]
INEXACT REAL	product1
REAL	product0
INEXACT REAL	c
INEXACT REAL	abig
REAL	ahi
REAL	alo
REAL	bhi
REAL	blo
REAL	err1
REAL	err2
REAL	err3
	Q = e[0]
REAL	pb
REAL	pc
REAL detsum vertex	pa
REAL	detsum
REAL	acxtail
REAL	acytail
REAL	bcxtail
REAL	bcytail
INEXACT REAL	detleft = (pa[0] - pc[0]) * (pb[1] - pc[1])
INEXACT REAL	detright = (pa[1] - pc[1]) * (pb[0] - pc[0])
REAL	detlefttail
REAL	detrighttail
REAL	det = estimate(4, B)
REAL	errbound = ccwerrboundB * detsum
REAL	B [4] = B3
REAL	C1 [8]
REAL	C2 [12]
REAL	D [16]
INEXACT REAL	B3
int	C1length = fast_expansion_sum_zeroelim(4, B, 4, u, C1)
int	C2length = fast_expansion_sum_zeroelim(C1length, C1, 4, u, C2)
int	Dlength = fast_expansion_sum_zeroelim(C2length, C2, 4, u, D)
REAL	u [4] = u3
INEXACT REAL	u3
INEXACT REAL	s1
INEXACT REAL	t1
REAL	s0
REAL	t0
INEXACT REAL	_i
INEXACT REAL	_j
REAL	_0
	acx = (REAL) (pa[0] - pc[0])
	bcx = (REAL) (pb[0] - pc[0])
	acy = (REAL) (pa[1] - pc[1])
	bcy = (REAL) (pb[1] - pc[1])
m	counterclockcount
REAL	pd
REAL	permanent
INEXACT REAL	bdxcdy1
INEXACT REAL	cdxbdy1
INEXACT REAL	cdxady1
INEXACT REAL	adxcdy1
INEXACT REAL	adxbdy1
INEXACT REAL	bdxady1
REAL	bdxcdy0
REAL	cdxbdy0
REAL	cdxady0
REAL	adxcdy0
REAL	adxbdy0
REAL	bdxady0
REAL	bc [4] = bc3
REAL	ca [4] = ca3
REAL	ab [4] = ab3
INEXACT REAL	bc3
INEXACT REAL	ca3
INEXACT REAL	ab3
REAL	axbc [8]
REAL	axxbc [16]
REAL	aybc [8]
REAL	ayybc [16]
REAL	adet [32]
int	axbclen = scale_expansion_zeroelim(4, bc, adx, axbc)
int	axxbclen = scale_expansion_zeroelim(axbclen, axbc, adx, axxbc)
int	aybclen = scale_expansion_zeroelim(4, bc, ady, aybc)
int	ayybclen = scale_expansion_zeroelim(aybclen, aybc, ady, ayybc)
int	alen = fast_expansion_sum_zeroelim(axxbclen, axxbc, ayybclen, ayybc, adet)
REAL	bxca [8]
REAL	bxxca [16]
REAL	byca [8]
REAL	byyca [16]
REAL	bdet [32]
int	bxcalen = scale_expansion_zeroelim(4, ca, bdx, bxca)
int	bxxcalen = scale_expansion_zeroelim(bxcalen, bxca, bdx, bxxca)
int	bycalen = scale_expansion_zeroelim(4, ca, bdy, byca)
int	byycalen = scale_expansion_zeroelim(bycalen, byca, bdy, byyca)
int	blen = fast_expansion_sum_zeroelim(bxxcalen, bxxca, byycalen, byyca, bdet)
REAL	cxab [8]
REAL	cxxab [16]
REAL	cyab [8]
REAL	cyyab [16]
REAL	cdet [32]
int	cxablen = scale_expansion_zeroelim(4, ab, cdx, cxab)
int	cxxablen = scale_expansion_zeroelim(cxablen, cxab, cdx, cxxab)
int	cyablen = scale_expansion_zeroelim(4, ab, cdy, cyab)
int	cyyablen = scale_expansion_zeroelim(cyablen, cyab, cdy, cyyab)
int	clen = fast_expansion_sum_zeroelim(cxxablen, cxxab, cyyablen, cyyab, cdet)
REAL	abdet [64]
int	ablen = fast_expansion_sum_zeroelim(alen, adet, blen, bdet, abdet)
REAL	fin1 [1152]
REAL	fin2 [1152]
REAL *	finnow = fin1
REAL *	finother = fin2
REAL *	finswap = finnow
int	finlength = fast_expansion_sum_zeroelim(ablen, abdet, clen, cdet, fin1)
REAL	adxtail
REAL	bdxtail
REAL	cdxtail
REAL	adytail
REAL	bdytail
REAL	cdytail
INEXACT REAL	adxadx1
INEXACT REAL	adyady1
INEXACT REAL	bdxbdx1
INEXACT REAL	bdybdy1
INEXACT REAL	cdxcdx1
INEXACT REAL	cdycdy1
REAL	adxadx0
REAL	adyady0
REAL	bdxbdx0
REAL	bdybdy0
REAL	cdxcdx0
REAL	cdycdy0
REAL	aa [4]
REAL	bb [4]
REAL	cc [4]
INEXACT REAL	aa3
INEXACT REAL	bb3
INEXACT REAL	cc3
INEXACT REAL	ti1
INEXACT REAL	tj1
REAL	ti0
REAL	tj0
REAL	v [4]
INEXACT REAL	v3
REAL	temp8 [8]
REAL	temp16a [16]
REAL	temp16b [16]
REAL	temp16c [16]
REAL	temp32a [32]
REAL	temp32b [32]
REAL	temp48 [48]
REAL	temp64 [64]
int	temp8len
int	temp16alen
int	temp16blen
int	temp16clen
int	temp32alen
int	temp32blen
int	temp48len
int	temp64len
REAL	axtbb [8]
REAL	axtcc [8]
REAL	aytbb [8]
REAL	aytcc [8]
int	axtbblen
int	axtcclen
int	aytbblen
int	aytcclen
REAL	bxtaa [8]
REAL	bxtcc [8]
REAL	bytaa [8]
REAL	bytcc [8]
int	bxtaalen
int	bxtcclen
int	bytaalen
int	bytcclen
REAL	cxtaa [8]
REAL	cxtbb [8]
REAL	cytaa [8]
REAL	cytbb [8]
int	cxtaalen
int	cxtbblen
int	cytaalen
int	cytbblen
REAL	axtbc [8]
REAL	aytbc [8]
REAL	bxtca [8]
REAL	bytca [8]
REAL	cxtab [8]
REAL	cytab [8]
int	axtbclen
int	aytbclen
int	bxtcalen
int	bytcalen
int	cxtablen
int	cytablen
REAL	axtbct [16]
REAL	aytbct [16]
REAL	bxtcat [16]
REAL	bytcat [16]
REAL	cxtabt [16]
REAL	cytabt [16]
int	axtbctlen
int	aytbctlen
int	bxtcatlen
int	bytcatlen
int	cxtabtlen
int	cytabtlen
REAL	axtbctt [8]
REAL	aytbctt [8]
REAL	bxtcatt [8]
REAL	bytcatt [8]
REAL	cxtabtt [8]
REAL	cytabtt [8]
int	axtbcttlen
int	aytbcttlen
int	bxtcattlen
int	bytcattlen
int	cxtabttlen
int	cytabttlen
REAL	abt [8]
REAL	bct [8]
REAL	cat [8]
int	abtlen = fast_expansion_sum_zeroelim(at_blen, at_b, bt_alen, bt_a, abt)
int	bctlen
int	catlen = fast_expansion_sum_zeroelim(ct_alen, ct_a, at_clen, at_c, cat)
REAL	abtt [4]
REAL	bctt [4]
REAL	catt [4]
int	abttlen
int	bcttlen
int	cattlen
INEXACT REAL	abtt3
INEXACT REAL	bctt3
INEXACT REAL	catt3
REAL	negate
	adx = (REAL) (pa[0] - pd[0])
	bdx = (REAL) (pb[0] - pd[0])
	cdx = (REAL) (pc[0] - pd[0])
	ady = (REAL) (pa[1] - pd[1])
	bdy = (REAL) (pb[1] - pd[1])
	cdy = (REAL) (pc[1] - pd[1])
REAL	bdxcdy
REAL	cdxbdy = cdx * bdy
REAL	cdxady = cdx * ady
REAL	adxcdy = adx * cdy
REAL	adxbdy = adx * bdy
REAL	bdxady = bdx * ady
REAL	alift = adx * adx + ady * ady
REAL	blift = bdx * bdx + bdy * bdy
REAL	clift = cdx * cdx + cdy * cdy
m	incirclecount = m->counterclockcount = m->orient3dcount = 0
REAL	aheight
REAL	bheight
REAL	cheight
REAL	dheight
REAL	adheighttail
REAL	bdheighttail
REAL	cdheighttail
INEXACT REAL	at_blarge
INEXACT REAL	at_clarge
INEXACT REAL	bt_clarge
INEXACT REAL	bt_alarge
INEXACT REAL	ct_alarge
INEXACT REAL	ct_blarge
REAL	at_b [4]
REAL	at_c [4]
REAL	bt_c [4]
REAL	bt_a [4]
REAL	ct_a [4]
REAL	ct_b [4]
int	at_blen
int	at_clen
int	bt_clen
int	bt_alen
int	ct_alen
int	ct_blen
INEXACT REAL	bdxt_cdy1
INEXACT REAL	cdxt_bdy1
INEXACT REAL	cdxt_ady1
INEXACT REAL	adxt_cdy1
INEXACT REAL	adxt_bdy1
INEXACT REAL	bdxt_ady1
REAL	bdxt_cdy0
REAL	cdxt_bdy0
REAL	cdxt_ady0
REAL	adxt_cdy0
REAL	adxt_bdy0
REAL	bdxt_ady0
INEXACT REAL	bdyt_cdx1
INEXACT REAL	cdyt_bdx1
INEXACT REAL	cdyt_adx1
INEXACT REAL	adyt_cdx1
INEXACT REAL	adyt_bdx1
INEXACT REAL	bdyt_adx1
REAL	bdyt_cdx0
REAL	cdyt_bdx0
REAL	cdyt_adx0
REAL	adyt_cdx0
REAL	adyt_bdx0
REAL	bdyt_adx0
INEXACT REAL	bdxt_cdyt1
INEXACT REAL	cdxt_bdyt1
INEXACT REAL	cdxt_adyt1
INEXACT REAL	adxt_cdyt1
INEXACT REAL	adxt_bdyt1
INEXACT REAL	bdxt_adyt1
REAL	bdxt_cdyt0
REAL	cdxt_bdyt0
REAL	cdxt_adyt0
REAL	adxt_cdyt0
REAL	adxt_bdyt0
REAL	bdxt_adyt0
REAL	w [16]
int	vlength
int	wlength = scale_expansion_zeroelim(bctlen, bct, adheight, w)
INEXACT REAL	_k
	adheight = (REAL) (aheight - dheight)
	bdheight = (REAL) (bheight - dheight)
	cdheight = (REAL) (cheight - dheight)
m	orient3dcount
vertex	torg
vertex	tdest
vertex	tapex
vertex	circumcenter = torg[1] + dy
REAL *	xi = (yao * dx - xao * dy) * (2.0 * denominator)
REAL *	eta = (xdo * dy - ydo * dx) * (2.0 * denominator)
int	offcenter
REAL	dodist
REAL	aodist = xao * xao + yao * yao
REAL	dadist
REAL	denominator
REAL	dx = (yao * dodist - ydo * aodist) * denominator
REAL	dy = (xdo * aodist - xao * dodist) * denominator
REAL	dxoff
REAL	dyoff
m	circumcentercount
	xdo = tdest[0] - torg[0]
	ydo = tdest[1] - torg[1]
	xao = tapex[0] - torg[0]
	yao = tapex[1] - torg[1]
m	undeads = 0
m	samples = 1
m	checksegments = 0
m	checkquality = 0
m	hyperbolacount = m->circletopcount = m->circumcentercount = 0
struct otri oppotri	oppooppotri
vertex	oppoorg
vertex	oppodest
int	horrors = 0
int	saveexact = b->noexact
triangle	ptr
b	noexact = 0
struct otri	oppotri
struct osub	opposubseg
vertex	oppoapex
int	shouldbedelaunay
subseg	sptr
struct badtriang *	badtri
int	exponent
int	expincrement
int	queuenumber
int	posexponent = 0
m	queuetail [queuenumber] = badtri
badtri	nexttriang = (struct badtriang *) NULL
void	enqtri
void	minedge
void	enqapex
void	enqorg
vertex	enqdest
	newbad = (struct badtriang *) poolalloc(&m->badtriangles)
newbad	poortri = encode(*enqtri)
newbad	key = minedge
newbad	triangapex = enqapex
newbad	triangorg = enqorg
newbad	triangdest = enqdest
	result = m->queuefront[m->firstnonemptyq]
m	queuefront [m->firstnonemptyq] = result->nexttriang
struct osub *	testsubseg
struct osub	testsym
struct badsubseg *	encroachedseg
REAL	dotproduct
int	encroached = 0
int	sides = 0
vertex	eorg
vertex	edest
vertex	eapex
struct otri *	testtri
struct osub	testsub
vertex	base1 = tapex
vertex	base2 = torg
vertex	org1
vertex	dest1
vertex	org2
vertex	dest2
vertex	joinvertex
REAL	dxao = tapex[0] - torg[0]
REAL	dyao = tapex[1] - torg[1]
REAL	dxod2 = dxod * dxod
REAL	dyod2 = dyod * dyod
REAL	dxda2 = dxda * dxda
REAL	dyda2 = dyda * dyda
REAL	dxao2 = dxao * dxao
REAL	dyao2 = dyao * dyao
REAL	apexlen = dxod2 + dyod2
REAL	orglen = dxda2 + dyda2
REAL	destlen = dxao2 + dyao2
REAL	angle = dxod * dxda + dyod * dyda
REAL	dist1
REAL	dist2
enum locateresult	searchpoint = pc[0] - (yac * bclen2 - ybc * aclen2) / (2.0 * ccwabc)
enum locateresult	searchtri
int	stopatsubsegment
struct osub	checkedge
vertex	forg
vertex	fdest
vertex	fapex
REAL	orgorient
REAL	destorient
int	moveleft
char *	firsttri
struct otri	sampletri
REAL	searchdist
REAL	dist
REAL	ahead = counterclockwise(m, b, torg, tdest, searchpoint)
long	samplesperblock = (m->samples * TRIPERBLOCK - 1) / m->triangles.maxitems + 1
long	totalsamplesleft = m->samples
long	samplesleft
long	population = m->triangles.itemsfirstblock
long	totalpopulation = m->triangles.maxitems
	sampleblock = m->triangles.firstblock
int	subsegmark
struct otri *	flipedge
struct otri topleft	topright
struct otri	top
struct otri botlcasing	botrcasing
struct otri toplcasing	toprcasing
struct osub botlsubseg	botrsubseg
struct osub toplsubseg	toprsubseg
vertex	leftvertex
vertex	rightvertex = first
vertex	botvertex
vertex	farvertex
enum insertvertexresult	segmentflaws
int	triflaws
struct otri botleft	botright
struct otri newbotleft	newbotright
struct otri	newtopright
struct osub	brokensubseg
struct osub	checksubseg
struct osub	rightsubseg
struct flipstacker *	newflip
vertex	first
vertex	topvertex
vertex	segmentorg
vertex	segmentdest
REAL	attrib
enum insertvertexresult	success = SUCCESSFULVERTEX
enum locateresult	intersect = ONEDGE
int	doflip
int	mirrorflag
int	enq
void	firstedge
void	lastedge
void	edgecount = 1
struct otri	besttri
struct otri	tempedge
vertex	leftbasevertex
vertex	rightbasevertex
vertex	testvertex
vertex	bestvertex
int	bestnumber = 1
struct otri *	deltri
struct otri	deltriright
struct otri lefttri	righttri
struct otri leftcasing	rightcasing
vertex	delvertex
vertex	neworg
struct otri	gluetri
void arraysize vertex *	sortarray = (vertex *) trimalloc(m->invertices * (int) sizeof(vertex))
int	arraysize
int	pivot
REAL	pivotx = sortarray[pivot][0]
REAL	pivoty = sortarray[pivot][1]
vertex	temp
	left = -1
	right = arraysize
void	median
int	axis
REAL	pivot1 = sortarray[pivot][axis]
REAL	pivot2 = sortarray[pivot][1 - axis]
	divider = arraysize >> 1
void	farleft
void	innerleft
void	innerright
void	farright = farrightflag
struct otri	baseedge
struct otri	nextedge
struct otri sidecasing topcasing	outercasing
vertex	innerleftdest
vertex	innerrightorg
vertex	innerleftapex
vertex	innerrightapex
vertex	farleftpt
vertex	farrightpt
vertex	farleftapex
vertex	farrightapex
vertex	lowerleft = innerleftdest
vertex	lowerright = innerrightorg
vertex	upperleft
vertex	upperright
vertex	nextapex
vertex	checkvertex = (vertex) NULL
int	changemade
int	badedge
int	leftfinished
int	rightfinished
void	vertices
struct otri *	startghost
struct otri	dissolveedge
struct otri	deadtriangle
vertex	markorg
long	hullsize = 0
struct otri hullleft	hullright
REAL	width
m	infvertex1 = (vertex) trimalloc(m->vertices.itembytes)
m	infvertex2 = (vertex) trimalloc(m->vertices.itembytes)
m	infvertex3 = (vertex) trimalloc(m->vertices.itembytes)
struct otri	searchedge
vertex	vertexloop
void	heapsize = m->invertices
void newevent struct event **	heap = newevent
struct event *	newevent
int	eventnum
int	parent
int	notdone = eventnum > 0
	eventx = newevent->xkey
	eventy = newevent->ykey
newevent	heapposition = eventnum
int	leftchild = 2 * eventnum + 1
int	rightchild
int	smallest
	thisevent = heap[eventnum]
	moveevent = heap[heapsize - 1]
void	eventheap
void	events = (struct event *) trimalloc(maxevents * (int) sizeof(struct event))
struct event **	freeevents = (struct event *) NULL
int	maxevents
int	fronttri
vertex	newsite
REAL	dxa
REAL	dya = leftvertex[1] - newsite[1]
REAL	dxb = rightvertex[0] - newsite[0]
REAL	dyb = rightvertex[1] - newsite[1]
REAL	ccwabc = counterclockwise(m, b, pa, pb, pc)
REAL	aclen2
REAL	bclen2 = xbc * xbc + ybc * ybc
REAL	ablen2 = xab * xab + yab * yab
m	circletopcount
	xac = pa[0] - pc[0]
	yac = pa[1] - pc[1]
	xbc = pb[0] - pc[0]
	ybc = pb[1] - pc[1]
	xab = pa[0] - pb[0]
	yab = pa[1] - pb[1]
void heapsize struct otri *	checktri
vertex	eventvertex
struct splaynode	splaytree
struct splaynode *	lefttree
struct splaynode *	righttree = splay(m, splaytree->rchild, searchpoint, searchtri)
struct splaynode *	leftright
int	rightofroot
int	rightofchild
leftright	rchild = righttree
struct splaynode	splayroot = splay(m, splayroot, searchvertex, searchtri)
struct splaynode	newkey
	newsplaynode = (struct splaynode *) poolalloc(&m->splaynodes)
splayroot	lchild = (struct splaynode *) NULL
REAL	topy
struct splaynode	bottommost
struct splaynode	searchvertex
	farrightflag = 0
struct event *	nextevent
struct otri	fliptri
struct otri lefttri righttri farlefttri	farrighttri
struct otri	inserttri
vertex	firstvertex = (vertex) eventheap[0]->eventptr
vertex	secondvertex
vertex	nextvertex
vertex	lastvertex = secondvertex
vertex	connectvertex
vertex	midvertex
REAL	lefttest
REAL	righttest
int	check4events
eventheap[0]	eventptr = (VOID *) freeevents
m	eextras = 0
	hulledges = divconqdelaunay(m, b)
int	trianglelist
int	triangleattriblist
int	trianglearealist
int	elements
int	corners
int	attribs
int	segmentlist
int	segmentmarkerlist
int	numberofsegments
long	elefilename
long	areafilename
long	polyfilename
FILE *	polyfile = (FILE *) NULL
int	attribindex
FILE *	elefile = fopen(elefilename, "r")
FILE *	areafile
char	inputline [INPUTLINESIZE]
char *	stringptr = readline(inputline, elefile, elefilename)
int	areaelements
struct otri	triangleloop
struct otri	triangleleft
struct otri	checkleft
struct otri	checkneighbor
struct osub	subsegloop
triangle *	vertexarray
triangle *	prevlink
triangle	nexttri
vertex	checkdest
vertex	checkapex
vertex	shorg
vertex	killvertex
int	corner [3]
int	end [2]
int	killvertexindex
int	incorners = corners
int	segmentmarkers = 0
int	boundmarker
int	aroundvertex
int	notfound
long	elementnumber = b->firstnumber
long	segmentnumber
m	inelements = elements
	vertexindex = 0
vertex	startvertex
REAL	leftccw = counterclockwise(m, b, searchpoint, startvertex, leftvertex)
REAL	rightccw = counterclockwise(m, b, startvertex, searchpoint, rightvertex)
int	leftflag = leftccw > 0.0
int	rightflag = rightccw > 0.0
void	splittri
void	splitsubseg
vertex	endpoint2
vertex	endpoint1
enum finddirectionresult	collinear = finddirection(m, b, splittri, endpoint1)
REAL	ex = endpoint2[0] - endpoint1[0]
REAL	ey = endpoint2[1] - endpoint1[1]
REAL	tx = tdest[0] - torg[0]
REAL	ty = tdest[1] - torg[1]
REAL	etx = torg[0] - endpoint2[0]
REAL	ety = torg[1] - endpoint2[1]
REAL	split = (ey * etx - ex * ety) / denom
REAL	denom = ty * ex - tx * ey
int	newmark
struct osub	crosssubseg
vertex	midvertex1
vertex	midvertex2
void	fixuptri
int	leftside
struct otri	fartri
struct osub	faredge
vertex	nearvertex
void	starttri
int	collision = 0
int	done = 0
triangle	encodedtri
int	index
int	end1
int	end2
struct osub	hullsubseg
vertex	horg
vertex	hdest
struct otri	neighbor
triangle **	virusloop = (triangle **) traverse(&m->viri)
struct osub	neighborsubseg
vertex	norg
vertex	ndest
vertex	deadorg
vertex	deaddest
vertex	deadapex
int	killorg
void	attribute
triangle **	regiontri
vertex	regionorg
vertex	regiondest
vertex	regionapex
void	holelist
void	holes = (int) strtol(stringptr, &stringptr, 0)
void	regionlist
int	regions = 0
struct otri *	regiontris
triangle **	holetri
vertex	searchorg
vertex	searchdest
int	dummy
struct osub	testsh
struct osub	currentenc
struct badsubseg *	encloop
REAL	segmentlength
REAL	nearestpoweroftwo
REAL	multiplier
REAL	divisor
int	acuteorg
int	acuteorg2
int	acutedest
int	acutedest2
vertex	borg
vertex	bdest
vertex	bapex
int	errorflag
struct osub	checkmark
m vertices	deaditemstack = (VOID *) NULL
char	infile
char infilename char *	string
char *	infilename = nodefilename
void	nodefilename
REAL	x
REAL	y
int	firstnode
int	nodemarkers
int	currentmarker
m	xminextreme = 10 * m->xmin - 9 * m->xmax
void	pointlist
void	pointattriblist
void	pointmarkerlist
void	numberofpoints
int	numberofpointattribs
int	coordindex = 0
m	invertices = numberofpoints
m	mesh_dim = 2
m	nextras = numberofpointattribs
m	readnodefile = 0
void	hlist = holelist
void	rlist = (REAL *) NULL
void argv FILE *	outfile = fopen(nodefilename, "w")
REAL *	palist
int *	pmlist = *pointmarkerlist
long	outvertices
int	vertexnumber = b->firstnumber
	plist = *pointlist
REAL *	talist
vertex	p1
vertex	p2
vertex	p3
vertex	mid1
vertex	mid2
vertex	mid3
	tlist = *trianglelist
int *	smlist
long	holenumber
long	regionnumber
long	subsegnumber = b->firstnumber
	slist = *segmentlist
void	edgelist
int **	edgemarkerlist
void	edgefilename
int *	emlist
struct otri triangleloop	trisym
long	edgenumber = b->firstnumber
	elist = *edgelist
void	vpointlist
void	vpointattriblist
void	vpointmarkerlist = (int *) NULL
void	vedgelist
void	vedgemarkerlist = (int *) NULL
REAL **	vnormlist
void	vnodefilename
void	vedgefilename
REAL *	normlist = *vnormlist
long	vnodenumber = b->firstnumber
long	vedgenumber = b->firstnumber
int **	neighborlist
void	neighborfilename
int	neighbor1
int	neighbor2
int	neighbor3
	nlist = *neighborlist
void	offfilename
vertex	p [3]
REAL	cossquaretable [8]
REAL	ratiotable [16] = 1.5
REAL	edgelength [3]
REAL	cossquare
REAL	triarea
REAL	shortest = minaltitude
REAL	longest = 0.0
REAL	trilongest2
REAL	smallestarea = minaltitude
REAL	biggestarea = 0.0
REAL	triminaltitude2
REAL	minaltitude = m->xmax - m->xmin + m->ymax - m->ymin
REAL	triaspect2
REAL	worstaspect = 0.0
REAL	smallestangle = 0.0
REAL	biggestangle = 2.0
REAL	radconst = PI / 18.0
REAL	degconst = 180.0 / PI
int	angletable [18]
int	aspecttable [16]
int	aspectindex
int	tendegree
int	acutebiggest = 1
int	ii
void	in
void	out
void vorout char *	triswitches
struct triangulateio *	vorout
REAL *	holearray
REAL *	regionarray
struct timeval tv0 tv1 tv2 tv3 tv4 tv5	tv6
struct timezone	tz
gettimeofday &	tv0
m	steinerleft = b.steiner
m	edges = (3l * m.triangles.items + m.hullsize) / 2l
out	numberofpointattributes = m.nextras
out	numberoftriangles = m.triangles.items
out	numberofcorners = (b.order + 1) * (b.order + 2) / 2
out	numberoftriangleattributes = m.eextras
out	numberofedges = m.edges
	return

Typedef Documentation

subseg

typedef REAL** subseg

Definition at line 525 of file triangle.cpp.

triangle

typedef REAL** triangle

Definition at line 508 of file triangle.cpp.

vertex

typedef REAL* vertex

Definition at line 542 of file triangle.cpp.

Enumeration Type Documentation

finddirectionresult

enum finddirectionresult

Enumerator
WITHIN
LEFTCOLLINEAR
RIGHTCOLLINEAR

Definition at line 389 of file triangle.cpp.

insertvertexresult

enum insertvertexresult

Enumerator
SUCCESSFULVERTEX
ENCROACHINGVERTEX
VIOLATINGVERTEX
DUPLICATEVERTEX

Definition at line 381 of file triangle.cpp.

locateresult

enum locateresult

Enumerator
INTRIANGLE
ONEDGE
ONVERTEX
OUTSIDE

Definition at line 373 of file triangle.cpp.

Function Documentation

alternateaxes()

void alternateaxes	(	vertex *	sortarray,
		int	arraysize,
		int	axis )

apex() [1/7]

apex	(	badotri	,
		bapex	)

apex() [2/7]

apex	(	fartri	,
		farvertex	)

apex() [3/7]

apex	(	horiz	,
		botvertex	)

apex() [4/7]

apex	(	leftcand	,
		upperleft	)

apex() [5/7]

apex	(	neartri	,
		nearvertex	)

apex() [6/7]

apex	(	rightcand	,
		upperright	)

apex() [7/7]

apex	(	top	,
		farvertex	)

badsubsegdealloc()

void badsubsegdealloc	(	struct mesh *	m,
		struct badsubseg *	dyingseg )

badsubsegtraverse()

struct badsubseg * badsubsegtraverse

(

struct mesh *

m

)

bond() [1/16]

bond	(	baseedge	,
		*	innerleft )

bond() [2/16]

bond	(	botleft	,
		botrcasing	)

bond() [3/16]

bond	(	botleft	,
		newbotleft	)

bond() [4/16]

bond	(	botleft	,
		toplcasing	)

bond() [5/16]

bond	(	botright	,
		botlcasing	)

bond() [6/16]

bond	(	botright	,
		newbotright	)

bond() [7/16]

bond	(	botright	,
		toprcasing	)

bond() [8/16]

bond	(	deltriright	,
		rightcasing	)

bond() [9/16]

bond	(	lefttri	,
		righttri	)

bond() [10/16]

bond	(	newbotleft	,
		botlcasing	)

bond() [11/16]

bond	(	newbotleft	,
		newbotright	)

bond() [12/16]

bond	(	newbotright	,
		botrcasing	)

bond() [13/16]

bond	(	topleft	,
		botlcasing	)

bond() [14/16]

bond	(	topleft	,
		toprcasing	)

bond() [15/16]

bond	(	topright	,
		botrcasing	)

bond() [16/16]

bond	(	topright	,
		toplcasing	)

boundingbox() [1/2]

boundingbox	(	m	,
		b	)

boundingbox() [2/2]

void boundingbox	(	struct mesh *	m,
		struct behavior *	b )

carveholes()

void carveholes	(	struct mesh *	m,
		struct behavior *	b,
		REAL *	holelist,
		int	holes,
		REAL *	regionlist,
		int	regions )

check4deadevent()

void check4deadevent	(	struct otri *	checktri,
		struct event **	freeevents,
		struct event **	eventheap,
		int *	heapsize )

checkdelaunay()

void checkdelaunay	(	struct mesh *	m,
		struct behavior *	b )

checkmesh()

void checkmesh	(	struct mesh *	m,
		struct behavior *	b )

checkseg4encroach()

int checkseg4encroach	(	struct mesh *	m,
		struct behavior *	b,
		struct osub *	testsubseg )

circletop()

REAL circletop	(	struct mesh *	m,
		vertex	pa,
		vertex	pb,
		vertex	pc,
		REAL	ccwabc )

circletopinsert()

struct splaynode * circletopinsert	(	struct mesh *	m,
		struct behavior *	b,
		struct splaynode *	splayroot,
		struct otri *	newkey,
		vertex	pa,
		vertex	pb,
		vertex	pc,
		REAL	topy )

conformingedge()

void conformingedge	(	struct mesh *	m,
		struct behavior *	b,
		vertex	endpoint1,
		vertex	endpoint2,
		int	newmark )

constrainededge()

void constrainededge	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	starttri,
		vertex	endpoint2,
		int	newmark ) const

counterclockwise()

REAL counterclockwise	(	struct mesh *	m,
		struct behavior *	b,
		vertex	pa,
		vertex	pb,
		vertex	pc )

counterclockwiseadapt() [1/2]

return counterclockwiseadapt	(	pa	,
		pb	,
		pc	,
		detsum	)

counterclockwiseadapt() [2/2]

REAL counterclockwiseadapt	(	vertex	pa,
		vertex	pb,
		vertex	pc,
		REAL	detsum )

createeventheap() [1/2]

createeventheap	(	m	,
		&	eventheap,
		&	events,
		&	freeevents )

createeventheap() [2/2]

void createeventheap	(	struct mesh *	m,
		struct event ***	eventheap,
		struct event **	events,
		struct event **	freeevents )

decode() [1/4]

decode	(	badtri->	poortri,
		badotri	)

decode() [2/4]

decode	(	t->	tri[0],
		printtri	)

decode() [3/4]

decode	(	t->	tri[1],
		printtri	)

decode() [4/4]

decode	(	t->	tri[2],
		printtri	)

delaunay()

long delaunay	(	struct mesh *	m,
		struct behavior *	b )

delaunayfixup() [1/3]

delaunayfixup	(	m	,
		b	,
		&	fartri,
		leftside	)

delaunayfixup() [2/3]

delaunayfixup	(	m	,
		b	,
		fixuptri	,
		leftside	)

delaunayfixup() [3/3]

void delaunayfixup	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	fixuptri,
		int	leftside )

deletevertex()

void deletevertex	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	deltri )

dequeuebadtriang()

struct badtriang * dequeuebadtriang

(

struct mesh *

m

)

destT() [1/5]

destT	(	badotri	,
		bdest	)

destT() [2/5]

destT	(	besttri	,
		bestvertex	)

destT() [3/5]

destT	(	horiz	,
		leftvertex	)

destT() [4/5]

destT	(	neartri	,
		rightvertex	)

destT() [5/5]

destT	(	splaytree->	keyedge,
		checkvertex	)

dissolve()

dissolve

(

dissolveedge

)

divconqdelaunay()

long divconqdelaunay	(	struct mesh *	m,
		struct behavior *	b )

divconqrecurse() [1/4]

divconqrecurse	(	m	,
		b	,
		&	sortarray[divider],
		vertices -	divider,
		1 -	axis,
		&	innerright,
		farright	)

divconqrecurse() [2/4]

divconqrecurse	(	m	,
		b	,
		sortarray	,
		divider	,
		1 -	axis,
		farleft	,
		&	innerleft )

divconqrecurse() [3/4]

divconqrecurse	(	m	,
		b	,
		sortarray	,
		i	,
		0	,
		&	hullleft,
		&	hullright )

divconqrecurse() [4/4]

void divconqrecurse	(	struct mesh *	m,
		struct behavior *	b,
		vertex *	sortarray,
		int	vertices,
		int	axis,
		struct otri *	farleft,
		struct otri *	farright )

dummyinit()

called is pointed to *void dummyinit	(	struct mesh *	m,
		struct behavior *	b,
		int	trianglebytes,
		int	subsegbytes )

edgelist()

if * edgelist

(

int *

)

Definition at line 14829 of file triangle.cpp.

enforcequality()

void enforcequality	(	struct mesh *	m,
		struct behavior *	b )

enqueuebadtri()

void enqueuebadtri	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	enqtri,
		REAL	minedge,
		vertex	enqapex,
		vertex	enqorg,
		vertex	enqdest )

enqueuebadtriang() [1/2]

enqueuebadtriang	(	m	,
		b	,
		newbad	)

enqueuebadtriang() [2/2]

void enqueuebadtriang	(	struct mesh *	m,
		struct behavior *	b,
		struct badtriang *	badtri )

estimate()

REAL estimate	(	int	elen,
		REAL *	e )

eventheapdelete() [1/2]

eventheapdelete	(	eventheap	,
		heapsize	,
		0	)

eventheapdelete() [2/2]

void eventheapdelete	(	struct event **	heap,
		int	heapsize,
		int	eventnum )

eventheapify() [1/2]

eventheapify	(	heap	,
		heapsize -	1,
		eventnum	)

eventheapify() [2/2]

void eventheapify	(	struct event **	heap,
		int	heapsize,
		int	eventnum )

eventheapinsert()

void eventheapinsert	(	struct event **	heap,
		int	heapsize,
		struct event *	newevent )

exactinit()

exactinit

(

)

Definition at line 4887 of file triangle.cpp.

fast_expansion_sum_zeroelim()

int fast_expansion_sum_zeroelim	(	int	elen,
		REAL *	e,
		int	flen,
		REAL *	f,
		REAL *	h )

fclose() [1/3]

fclose

(

elefile

)

fclose() [2/3]

fclose

(

outfile

)

fclose() [3/3]

fclose

(

polyfile

)

finddirection() [1/2]

finddirection	(	m	,
		b	,
		&	searchtri2,
		endpoint2	)

finddirection() [2/2]

enum finddirectionresult finddirection	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	searchtri,
		vertex	searchpoint )

findfield() [1/2]

char * findfield

(

)

findfield() [2/2]

char * findfield

(

char *

string

)

finishfile() [1/2]

void finishfile	(	FILE *	outfile,
		int	argc,
		char **	argv )

finishfile() [2/2]

finishfile	(	outfile	,
		argc	,
		argv	)

flip()

flip	(	m	,
		b	,
		&	fixuptri )

for() [1/4]

for

(

elementnumber

= 1; elementnumber <= m->inelements; elementnumber++

)

Definition at line 11215 of file triangle.cpp.

for() [2/4]

for

(

i

= 0; i < m->eextras; i++

)

Definition at line 4688 of file triangle.cpp.

for() [3/4]

for

(

)

Definition at line 3326 of file triangle.cpp.

for() [4/4]

for

(

j

= 1; j < m->invertices; j++

)

Definition at line 10000 of file triangle.cpp.

formskeleton() [1/2]

void formskeleton	(	struct mesh *	m,
		struct behavior *	b,
		FILE *	polyfile,
		char *	polyfilename )

formskeleton() [2/2]

void formskeleton	(	struct mesh *	m,
		struct behavior *	b,
		int *	segmentlist,
		int *	segmentmarkerlist,
		int	numberofsegments )

fprintf() [1/12]

fprintf	(	outfile	,
		"# Generated by"	)

fprintf() [2/12]

fprintf	(	outfile	,
		"%d %d %d %d\n"	,
		0	,
		m->	mesh_dim,
		m->	nextras,
		1 - b->	nobound )

fprintf() [3/12]

fprintf	(	outfile	,
		"%d\n"	,
		holes	)

fprintf() [4/12]

fprintf	(	outfile	,
		"%ld %d %d %d\n"	,
		m->triangles.	items,
		2	,
		m->	nextras,
		0	)

fprintf() [5/12]

fprintf	(	outfile	,
		"%ld %d %d %d\n"	,
		outvertices	,
		m->	mesh_dim,
		m->	nextras,
		1 - b->	nobound )

fprintf() [6/12]

fprintf	(	outfile	,
		"%ld %d %d\n"	,
		m->triangles.	items,
		(b->order+1) *(b->order+2)/	2,
		m->	eextras )

fprintf() [7/12]

fprintf	(	outfile	,
		"%ld %d\n"	,
		m->	edges,
		0	)

fprintf() [8/12]

fprintf	(	outfile	,
		"%ld %d\n"	,
		m->	edges,
		1 - b->	nobound )

fprintf() [9/12]

fprintf	(	outfile	,
		"%ld %d\n"	,
		m->subsegs.	items,
		1 - b->	nobound )

fprintf() [10/12]

fprintf	(	outfile	,
		"%ld %d\n"	,
		m->triangles.	items,
		3	)

fprintf() [11/12]

fprintf	(	outfile	,
		"\n"	)

fprintf() [12/12]

fprintf	(	outfile	,
		"OFF\n%ld %ld %ld\n"	,
		outvertices	,
		m->triangles.	items,
		m->	edges )

frontlocate()

struct splaynode * frontlocate	(	struct mesh *	m,
		struct splaynode *	splayroot,
		struct otri *	bottommost,
		vertex	searchvertex,
		struct otri *	searchtri,
		int *	farright )

getvertex()

vertex getvertex	(	struct mesh *	m,
		struct behavior *	b,
		int	number )

highorder()

void highorder	(	struct mesh *	m,
		struct behavior *	b )

if() [1/163]

if

(

!

b->quiet||(b->noholes &&b->convex)

)

Definition at line 13005 of file triangle.cpp.

if() [2/163]

if

(

!b->nobound &&(*==*int

NULL

)

Definition at line 14386 of file triangle.cpp.

if() [3/163]

if

(

!b->quiet &&b->conformdel &&

m->badsubsegs.items > 0) &&(m->steinerleft==0

)

Definition at line 13684 of file triangle.cpp.

if() [4/163]

if

(

!b->

quiet

)

Definition at line 6714 of file triangle.cpp.

if() [5/163]

if

(

!b->refine &&!b->

poly

)

Definition at line 3537 of file triangle.cpp.

if() [6/163]

if

(

!b.

quiet

)

Definition at line 15728 of file triangle.cpp.

if() [7/163]

if

(

!

deadtribadotri.tri) &&(borg==badtri->triangorg) &&(bdest==badtri->triangdest) &&(bapex==badtri->triangapex

)

Definition at line 13510 of file triangle.cpp.

if() [8/163]

if

(

!

scoutsegmentm, b, &searchtri1, endpoint1, newmark

)

Definition at line 11974 of file triangle.cpp.

if() [9/163]

if

(

!

scoutsegmentm, b, &searchtri2, endpoint2, newmark

)

Definition at line 11980 of file triangle.cpp.

if() [10/163]

if	(	!strcmp(&->[->innodefilename - 4]	,
		".ele"	)

Definition at line 3510 of file triangle.cpp.

if() [11/163]

if	(	!strcmp(&->[->innodefilename - 5]	,
		".area"	)

Definition at line 3514 of file triangle.cpp.

if() [12/163]

if	(	!strcmp(&->[->innodefilename - 5]	,
		".node"	)

Definition at line 3502 of file triangle.cpp.

if() [13/163]

if	(	!strcmp(&->[->innodefilename - 5]	,
		".poly"	)

Definition at line 3505 of file triangle.cpp.

if() [14/163]

if

(

((holes > 0) &&!b->noholes)||!b->convex||(regions > 0)

)

Definition at line 13020 of file triangle.cpp.

if() [15/163]

if

(

((leftvertex[0]==endpoint2[0]) &&(leftvertex[1]==endpoint2[1]))||((rightvertex[0]==endpoint2[0]) &&(rightvertex[1]==endpoint2[1]))

)

Definition at line 11837 of file triangle.cpp.

if() [16/163]

if

(

(acxtail==0.0) &&(acytail==0.0) &&(bcxtail==0.0) &&(bcytail==0.0)

)

Definition at line 5205 of file triangle.cpp.

if() [17/163]

if

(

(adxtail !=0.0)||(adytail !=0.0)

)

Definition at line 5591 of file triangle.cpp.

if() [18/163]

if

(

(adxtail !=0.0)||(adytail !=0.0)||(bdxtail !=0.0)||(bdytail !=0.0)

)

Definition at line 5468 of file triangle.cpp.

if() [19/163]

if

(

(adxtail==0.0) &&(bdxtail==0.0) &&(cdxtail==0.0) &&(adytail==0.0) &&(bdytail==0.0) &&(cdytail==0.0) &&(adheighttail==0.0) &&(bdheighttail==0.0) &&(cdheighttail==0.0)

)

Definition at line 6085 of file triangle.cpp.

if() [20/163]

if

(

(adxtail==0.0) &&(bdxtail==0.0) &&(cdxtail==0.0) &&(adytail==0.0) &&(bdytail==0.0) &&(cdytail==0.0)

)

Definition at line 5432 of file triangle.cpp.

if() [21/163]

if

(

(apexlen< orglen) &&(apexlen< destlen)

)

Definition at line 7257 of file triangle.cpp.

if() [22/163]

if

(

(b->minangle > 0.0)||b->vararea||b->fixedarea||b->

usertest

)

Definition at line 13645 of file triangle.cpp.

if() [23/163]

if

(

(b->regionattrib||b->vararea) &&!b->

refine

)

Definition at line 14224 of file triangle.cpp.

if() [24/163]

if

(

(b->voronoi||b->neighbors) &&(trisize< int(6 *sizeof(triangle)+sizeof(int)))

)

Definition at line 4349 of file triangle.cpp.

if() [25/163]

if

(

(bdxtail !=0.0)||(bdytail !=0.0)

)

Definition at line 5688 of file triangle.cpp.

if() [26/163]

if

(

(bdxtail !=0.0)||(bdytail !=0.0)||(cdxtail !=0.0)||(cdytail !=0.0)

)

Definition at line 5454 of file triangle.cpp.

if() [27/163]

if

(

(cdxtail !=0.0)||(cdytail !=0.0)

)

Definition at line 5785 of file triangle.cpp.

if() [28/163]

if

(

(cdxtail !=0.0)||(cdytail !=0.0)||(adxtail !=0.0)||(adytail !=0.0)

)

Definition at line 5461 of file triangle.cpp.

if() [29/163]

if

(

(det > errbound)||(-det > errbound)

)

Definition at line 5939 of file triangle.cpp.

if() [30/163]

if

(

(det >=errbound)||(-det >=errbound)

)

Definition at line 5196 of file triangle.cpp.

if() [31/163]

if

(

(dodist< aodist) &&(dodist< dadist)

)

Definition at line 6570 of file triangle.cpp.

if() [32/163]

if

(

(eindex< elen) &&(findex< flen)

)

Definition at line 4991 of file triangle.cpp.

if() [33/163]

if

(

(farvertex[0]==endpoint2[0]) &&(farvertex[1]==endpoint2[1])

)

Definition at line 12183 of file triangle.cpp.

if() [34/163]

if

(

(firstvertex[0]==secondvertex[0]) &&(firstvertex[1]==secondvertex[1])

)

Definition at line 10854 of file triangle.cpp.

if() [35/163]

if

(

(fnow > enow)

= = (fnow > -enow)

)

Definition at line 4983 of file triangle.cpp.

if() [36/163]

if

(

(holes > 0) &&!b->

noholes

)

Definition at line 13032 of file triangle.cpp.

if() [37/163]

if

(

(intersect==ONEDGE)||(intersect==OUTSIDE)

)

Definition at line 8278 of file triangle.cpp.

if() [38/163]

if

(

(leftvertex[0]==endpoint1[0]) &&(leftvertex[1]==endpoint1[1])

)

Definition at line 11780 of file triangle.cpp.

if() [39/163]

if

(

(leftvertex[1]< rightvertex[1])||((leftvertex[1]==rightvertex[1]) &&(leftvertex[0]< rightvertex[0]))

)

Definition at line 10469 of file triangle.cpp.

if() [40/163]

if

(

(m->eextras > 0) &&(*==*REAL

NULL

)

Definition at line 14548 of file triangle.cpp.

if() [41/163]

if

(

(m->nextras > 0) &&(*==*REAL

NULL

)

Definition at line 14381 of file triangle.cpp.

if() [42/163]

if

(

(Q !=0.0)||(hindex==0)

)

Definition at line 5033 of file triangle.cpp.

if() [43/163]

else if

(

(rightvertex[0] !=endpoint1[0])||(rightvertex[1] !=endpoint1[1])

)

Definition at line 11782 of file triangle.cpp.

if() [44/163]

if

(

(tdest[0]==searchpoint[0]) &&(tdest[1]==searchpoint[1])

)

Definition at line 7769 of file triangle.cpp.

if() [45/163]

if

(

(torg[0]==searchpoint[0]) &&(torg[1]==searchpoint[1])

)

Definition at line 7766 of file triangle.cpp.

if() [46/163]

if

(

adheighttail !

= 0.0

)

Definition at line 6246 of file triangle.cpp.

if() [47/163]

if

(

adxtail !

= 0.0

)

Definition at line 5476 of file triangle.cpp.

if() [48/163]

if

(

adxtail

= = 0.0

)

Definition at line 6110 of file triangle.cpp.

if() [49/163]

if

(

adytail !

= 0.0

)

Definition at line 5495 of file triangle.cpp.

if() [50/163]

else if

(

ahead

= = 0.0

)

Definition at line 7779 of file triangle.cpp.

if() [51/163]

if	(	angle	,
		b->	goodangle )

Definition at line 7313 of file triangle.cpp.

if() [52/163]

if

(

area

= = 0.0

)

Definition at line 12194 of file triangle.cpp.

if() [53/163]

if

(

arraysize - divider >=

2

)

Definition at line 9375 of file triangle.cpp.

if() [54/163]

if

(

arraysize<=

3

)

Definition at line 9367 of file triangle.cpp.

if() [55/163]

if

(

arraysize

= = 2

)

Definition at line 9216 of file triangle.cpp.

if() [56/163]

if

(

b->convex||!b->

poly

)

Definition at line 12551 of file triangle.cpp.

if() [57/163]

if

(

b->dwyer &&

axis==1

)

Definition at line 9458 of file triangle.cpp.

if() [58/163]

if

(

b->

goodangle = = 1.0

)

Initial value:

{
  struct otri triangleloop

Definition at line 3524 of file triangle.cpp.

if() [59/163]

if

(

b->

innodefilename[0] = = '\0'

)

Definition at line 3499 of file triangle.cpp.

if() [60/163]

if

(

b->jettison &&b->nonodewritten &&!b->

quiet

)

Definition at line 3555 of file triangle.cpp.

if() [61/163]

if

(

b->poly||b->

refine

)

Definition at line 15574 of file triangle.cpp.

if() [62/163]

b goodangle * if

(

b->refine &&b->

noiterationnum

)

Definition at line 3530 of file triangle.cpp.

if() [63/163]

if

(

b->refine||!b->

poly

)

Definition at line 3542 of file triangle.cpp.

if() [64/163]

if

(

b->vararea||b->fixedarea||b->

usertest

)

Definition at line 7286 of file triangle.cpp.

if() [65/163]

if

(

b->verbose &&

m->badsubsegs.items > 0

)

Definition at line 13636 of file triangle.cpp.

if() [66/163]

if	(	b->	verbose,
		1	)

Definition at line 8245 of file triangle.cpp.

if() [67/163]

if	(	b->	verbose,
		2	)

Definition at line 6920 of file triangle.cpp.

if() [68/163]

if

(

b->weighted &&

b->poly||b->quality

)

Definition at line 3547 of file triangle.cpp.

if() [69/163]

if

(

b.nonodewritten||

b.noiterationnum &&m.readnodefile

)

Definition at line 15882 of file triangle.cpp.

if() [70/163]

if	(	b.	order,
		1	)

Definition at line 15851 of file triangle.cpp.

if() [71/163]

if

(

b.poly &&

m.triangles.items > 0

)

Definition at line 15797 of file triangle.cpp.

if() [72/163]

if

(

b.poly||b.

convex

)

Definition at line 15917 of file triangle.cpp.

if() [73/163]

if

(

b.quality &&

m.triangles.items > 0

)

Definition at line 15830 of file triangle.cpp.

if() [74/163]

if

(

b.

refine

)

Definition at line 15736 of file triangle.cpp.

if() [75/163]

if

(

badtri->key >=1.

0

)

Definition at line 6930 of file triangle.cpp.

if() [76/163]

if

(

bdheighttail !

= 0.0

)

Definition at line 6252 of file triangle.cpp.

if() [77/163]

if

(

bdxtail !

= 0.0

)

Definition at line 5514 of file triangle.cpp.

if() [78/163]

if

(

bdytail !

= 0.0

)

Definition at line 5533 of file triangle.cpp.

if() [79/163]

if	(	bestnumber	,
		1	)

Definition at line 8907 of file triangle.cpp.

if() [80/163]

if

(

biggestangle >=1.

0

)

Definition at line 15500 of file triangle.cpp.

if() [81/163]

if

(

cdheighttail !

= 0.0

)

Definition at line 6258 of file triangle.cpp.

if() [82/163]

if

(

cdxtail !

= 0.0

)

Definition at line 5552 of file triangle.cpp.

if() [83/163]

if

(

cdytail !

= 0.0

)

Definition at line 5571 of file triangle.cpp.

if() [84/163]

if

(

checkedge.

tri = = m->dummytri

)

Definition at line 10161 of file triangle.cpp.

if() [85/163]

if

(

checkvertex !

= endpoint1

)

Definition at line 12281 of file triangle.cpp.

if() [86/163]

if

(

checkvertex

= = splaytree->keydest

)

Definition at line 10579 of file triangle.cpp.

if() [87/163]

else if

(

collinear

= = LEFTCOLLINEAR

)

Definition at line 11846 of file triangle.cpp.

if() [88/163]

if

(

collision

)

Definition at line 12237 of file triangle.cpp.

if() [89/163]

if	(	counterclockwise(m, b, innerleftdest, innerleftapex, innerrightorg)	,
		0.	0 )

Definition at line 9501 of file triangle.cpp.

if() [90/163]

if	(	counterclockwise(m, b, innerrightapex, innerrightorg, innerleftdest)	,
		0.	0 )

Definition at line 9510 of file triangle.cpp.

if() [91/163]

if

(

crosssubseg.

ss = = m->dummysub

)

Definition at line 11864 of file triangle.cpp.

if() [92/163]

if

(

current+m->vertices.itemsfirstblock<=

number

)

Definition at line 4597 of file triangle.cpp.

if() [93/163]

if

(

denom

= = 0.0

)

Definition at line 11729 of file triangle.cpp.

if() [94/163]

if	(	detleft	,
		0.	0 )

Definition at line 5264 of file triangle.cpp.

if() [95/163]

if

(

)

Initial value:

{
  struct badtriang *result

Definition at line 5270 of file triangle.cpp.

if() [96/163]

if

(

doflip

)

Definition at line 8921 of file triangle.cpp.

if() [97/163]

if	(	edgecount	,
		3	)

Definition at line 9002 of file triangle.cpp.

if() [98/163]

if

(

elefile

= = (FILE *) NULL

)

Definition at line 11185 of file triangle.cpp.

if() [99/163]

if

(

encodedtri !

= (triangle) NULL

)

Definition at line 12277 of file triangle.cpp.

if() [100/163]

if

(

encroached &&

!b->nobisect||((b->nobisect==1) &&(sides==2))

)

Definition at line 7175 of file triangle.cpp.

if() [101/163]

if	(	eventnum	,
		0	)

Definition at line 10386 of file triangle.cpp.

if() [102/163]

if

(

eventvertex !

= (vertex) NULL

)

Definition at line 10542 of file triangle.cpp.

if() [103/163]

if

(

faredge.ss !

= m->dummysub

)

Definition at line 12055 of file triangle.cpp.

if() [104/163]

if

(

fartri.

tri = = m->dummytri

)

Definition at line 12051 of file triangle.cpp.

if() [105/163]

if

(

hh !

= 0

)

Definition at line 5081 of file triangle.cpp.

if() [106/163]

if	(	holes	,
		0	)

Definition at line 14750 of file triangle.cpp.

if() [107/163]

else if

(

horrors

= = 0

)

Definition at line 6770 of file triangle.cpp.

if() [108/163]

if	(	increment	,
		0	)

Definition at line 3575 of file triangle.cpp.

if() [109/163]

else if

(

increment

= = 0

)

Definition at line 3601 of file triangle.cpp.

if() [110/163]

if

(

innerleftdest

= = farleftpt

)

Definition at line 9538 of file triangle.cpp.

if() [111/163]

if

(

innerrightorg

= = farrightpt

)

Definition at line 9542 of file triangle.cpp.

if() [112/163]

if

(

intersect

= = ONVERTEX

)

Definition at line 8271 of file triangle.cpp.

if() [113/163]

if	(	left	,
		1	)

Definition at line 9254 of file triangle.cpp.

if() [114/163]

if	(	left	,
		median	)

Definition at line 9332 of file triangle.cpp.

if() [115/163]

if

(

leftccw

= = 0.0

)

Definition at line 11662 of file triangle.cpp.

if() [116/163]

if

(

leftflag &&

rightflag

)

Definition at line 11622 of file triangle.cpp.

if() [117/163]

if

(

leftside

)

Definition at line 12064 of file triangle.cpp.

if() [118/163]

if

(

leftsubseg.ss !

= m->dummysub

)

Definition at line 9020 of file triangle.cpp.

if() [119/163]

else if

(

lefttree->

rchild = = (struct splaynode *) NULL

)

Definition at line 10652 of file triangle.cpp.

if() [120/163]

if

(

lefttree

= = (struct splaynode *) NULL

)

Definition at line 10648 of file triangle.cpp.

if() [121/163]

if

(

m->

checksegments = = 0

)

Definition at line 7945 of file triangle.cpp.

if() [122/163]

else if	(	m->eextras+b->	regionattrib,
		0	)

Definition at line 4342 of file triangle.cpp.

if() [123/163]

if

(

m->mesh_dim !

= 2

)

Definition at line 13998 of file triangle.cpp.

if() [124/163]

if

(

m->

queuefront[queuenumber] = = (struct badtriang *) NULL

)

Definition at line 6966 of file triangle.cpp.

if() [125/163]

if

(

m->recenttri.tri !

= (triangle *) NULL

)

Definition at line 7676 of file triangle.cpp.

if() [126/163]

if	(	m->	steinerleft,
		0	)

Definition at line 11757 of file triangle.cpp.

if() [127/163]

if

(

m->triangles.

items = = 0

)

Definition at line 11056 of file triangle.cpp.

if() [128/163]

if	(	m->viri.	items,
		0	)

Definition at line 13100 of file triangle.cpp.

if() [129/163]

if	(	m->ymax - m->	ymin,
		width	)

Definition at line 10076 of file triangle.cpp.

if() [130/163]

if	(	m.	regions,
		0	)

Definition at line 15947 of file triangle.cpp.

if() [131/163]

if	(	maxlen	,
		0.05 *(triorg[0] *triorg[0]+triorg[1] *triorg[1])+0.	02 )

Definition at line 1395 of file triangle.cpp.

if() [132/163]

if

(

memptr

= = (VOID *) NULL

)

Definition at line 1434 of file triangle.cpp.

if() [133/163]

if

(

neighbortri.tri !

= m->dummytri

)

Definition at line 7127 of file triangle.cpp.

if() [134/163]

if

(

newseg

= = (struct badsubseg *) NULL

)

Definition at line 4557 of file triangle.cpp.

if() [135/163]

if

(

newsubseg.

ss = = m->dummysub

)

Definition at line 7837 of file triangle.cpp.

if() [136/163]

if

(

newsubseg

= = (subseg *) NULL

)

Definition at line 4458 of file triangle.cpp.

if() [137/163]

if

(

newtriangle

= = (triangle *) NULL

)

Definition at line 4412 of file triangle.cpp.

if() [138/163]

if

(

newvertex

= = (vertex) NULL

)

Definition at line 4504 of file triangle.cpp.

if() [139/163]

if

(

outfile

= = (FILE *) NULL

)

Definition at line 14399 of file triangle.cpp.

if() [140/163]

if

(

posexponent

)

Definition at line 6959 of file triangle.cpp.

if() [141/163]

if

(

printtri.

tri = = m->dummytri

)

Definition at line 3682 of file triangle.cpp.

if() [142/163]

if

(

printvertex

= = (vertex) NULL

)

if() [143/163]

if	(	regions	,
		0	)

Definition at line 13012 of file triangle.cpp.

if() [144/163]

if

(

result

= = m->queuetail[m->firstnonemptyq]

)

Definition at line 7066 of file triangle.cpp.

if() [145/163]

else if

(

rightccw

= = 0.0

)

Definition at line 11664 of file triangle.cpp.

if() [146/163]

else if

(

rightofhyperbola(m, &splayroot->keyedge, searchpoint)

)

Definition at line 10696 of file triangle.cpp.

if() [147/163]

if

(

rightsubseg.ss !

= m->dummysub

)

Definition at line 9024 of file triangle.cpp.

if() [148/163]

else if

(

righttree->

lchild = = (struct splaynode *) NULL

)

Definition at line 10656 of file triangle.cpp.

if() [149/163]

else if

(

righttree

= = (struct splaynode *) NULL

)

Definition at line 10650 of file triangle.cpp.

if() [150/163]

if

(

scoutsegment(m, b, &searchtri1, endpoint2, newmark)

)

Definition at line 12299 of file triangle.cpp.

if() [151/163]

if

(

scoutsegment(m, b, &searchtri2, endpoint1, newmark)

)

Definition at line 12332 of file triangle.cpp.

if() [152/163]

smallestarea *biggestarea * if

(

smallestangle >=1.

0

)

Definition at line 15495 of file triangle.cpp.

if() [153/163]

if

(

splayroot

= = (struct splaynode *) NULL

)

Definition at line 10693 of file triangle.cpp.

if() [154/163]

if

(

splaytree

= = (struct splaynode *) NULL

)

Definition at line 10575 of file triangle.cpp.

if() [155/163]

if

(

splitseg

= = (struct osub *) NULL

)

Definition at line 8249 of file triangle.cpp.

if() [156/163]

if

(

success !

= SUCCESSFULVERTEX

)

Definition at line 11750 of file triangle.cpp.

if() [157/163]

if

(

success

= = DUPLICATEVERTEX

)

Definition at line 11938 of file triangle.cpp.

if() [158/163]

if

(

top.

tri = = m->dummytri

)

Definition at line 7940 of file triangle.cpp.

if() [159/163]

if

(

vertexmark(tridest)

= = 0

)

Definition at line 7832 of file triangle.cpp.

if() [160/163]

if

(

vertexmark(triorg)

= = 0

)

Definition at line 7829 of file triangle.cpp.

if() [161/163]

else if

(

vertices

= = 2

)

Definition at line 9769 of file triangle.cpp.

if() [162/163]

if

(

vorout !

= (struct triangulateio *) NULL

)

Definition at line 15874 of file triangle.cpp.

if() [163/163]

if

(

width

= = 0.0

)

Definition at line 10079 of file triangle.cpp.

incircle()

REAL incircle	(	struct mesh *	m,
		struct behavior *	b,
		vertex	pa,
		vertex	pb,
		vertex	pc,
		vertex	pd )

incircleadapt() [1/2]

return incircleadapt	(	pa	,
		pb	,
		pc	,
		pd	,
		permanent	)

incircleadapt() [2/2]

REAL incircleadapt	(	vertex	pa,
		vertex	pb,
		vertex	pc,
		vertex	pd,
		REAL	permanent )

incrementaldelaunay()

long incrementaldelaunay	(	struct mesh *	m,
		struct behavior *	b )

infecthull()

void infecthull	(	struct mesh *	m,
		struct behavior *	b )

info()

void info

(

)

Definition at line 1548 of file triangle.cpp.

initializetrisubpools() [1/2]

initializetrisubpools	(	m	,
		b	)

initializetrisubpools() [2/2]

void initializetrisubpools	(	struct mesh *	m,
		struct behavior *	b )

initializevertexpool() [1/2]

initializevertexpool	(	m	,
		b	)

initializevertexpool() [2/2]

void initializevertexpool	(	struct mesh *	m,
		struct behavior *	b )

insertsegment()

void insertsegment	(	struct mesh *	m,
		struct behavior *	b,
		vertex	endpoint1,
		vertex	endpoint2,
		int	newmark )

insertsubseg() [1/3]

insertsubseg	(	m	,
		b	,
		&	fixuptri,
		newmark	)

insertsubseg() [2/3]

insertsubseg	(	m	,
		b	,
		searchtri	,
		newmark	)

insertsubseg() [3/3]

void insertsubseg	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	tri,
		int	subsegmark )

insertvertex()

enum insertvertexresult insertvertex	(	struct mesh *	m,
		struct behavior *	b,
		vertex	newvertex,
		struct otri *	searchtri,
		struct osub *	splitseg,
		int	segmentflaws,
		int	triflaws )

internalerror()

void internalerror

(

)

Definition at line 3268 of file triangle.cpp.

lnext() [1/3]

lnext	(	dissolveedge	,
		deadtriangle	)

lnext() [2/3]

lnext	(	nextedge	,
		checkedge	)

lnext() [3/3]

lnext	(	top	,
		topright	)

lnextself() [1/5]

lnextself

(

baseedge

)

lnextself() [2/5]

lnextself

(

hulltri

)

lnextself() [3/5]

lnextself

(

lefttri

)

lnextself() [4/5]

lnextself

(

newbotleft

)

lnextself() [5/5]

lnextself

(

nextedge

)

locate()

enum locateresult locate	(	struct mesh *	m,
		struct behavior *	b,
		vertex	searchpoint,
		struct otri *	searchtri )

lprev() [1/5]

lprev	(	horiz	,
		botright	)

lprev() [2/5]

lprev	(	lefttri	,
		bottommost	)

lprev() [3/5]

lprev	(	nextedge	,
		finaledge	)

lprev() [4/5]

lprev	(	nextedge	,
		searchedge	)

lprev() [5/5]

lprev	(	top	,
		topleft	)

lprevself() [1/4]

lprevself

(

bottommost

)

lprevself() [2/4]

lprevself

(

dissolveedge

)

lprevself() [3/4]

lprevself

(

newbotright

)

lprevself() [4/4]

lprevself

(

righttri

)

m() [1/5]

poolinit & m

(

2 *m->invertices -

2

)

->invertices-2):TRIPERBLOCK, 4

m() [2/5]

poolinit & m

(

REAL

)

m() [3/5]

poolinit & m

(

struct badsubseg

)

m() [4/5]

poolinit & m

(

struct splaynode

)

m() [5/5]

pooldealloc & m

(

VOID *

)

main()

int main	(	int	argc,
		char **	argv )

makesubseg()

void makesubseg	(	struct mesh *	m,
		struct osub *	newsubseg )

maketriangle() [1/2]

maketriangle	(	m	,
		b	,
		&	newbotleft )

maketriangle() [2/2]

void maketriangle	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	newotri )

makevertexmap()

void makevertexmap	(	struct mesh *	m,
		struct behavior *	b )

markhull()

void markhull	(	struct mesh *	m,
		struct behavior *	b )

mergehulls() [1/2]

mergehulls	(	m	,
		b	,
		farleft	,
		&	innerleft,
		&	innerright,
		farright	,
		axis	)

mergehulls() [2/2]

void mergehulls	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	farleft,
		struct otri *	innerleft,
		struct otri *	innerright,
		struct otri *	farright,
		int	axis )

neighborlist()

if * neighborlist

(

int *

)

Definition at line 15191 of file triangle.cpp.

nonregular()

REAL nonregular	(	struct mesh *	m,
		struct behavior *	b,
		vertex	pa,
		vertex	pb,
		vertex	pc,
		vertex	pd )

numbernodes()

void numbernodes	(	struct mesh *	m,
		struct behavior *	b )

oprev() [1/2]

oprev	(	deltriright	,
		righttri	)

oprev() [2/2]

oprev	(	hulltri	,
		nexttri	)

org() [1/7]

org	(	badotri	,
		borg	)

org() [2/7]

org	(	horiz	,
		first	)

org() [3/7]

org	(	horiz	,
		rightvertex	)

org() [4/7]

org	(	lefttri	,
		neworg	)

org() [5/7]

org	(	neartri	,
		leftvertex	)

org() [6/7]

org	(	searchtri1	,
		endpoint1	)

org() [7/7]

org	(	searchtri2	,
		endpoint2	)

orient3d()

REAL orient3d	(	struct mesh *	m,
		struct behavior *	b,
		vertex	pa,
		vertex	pb,
		vertex	pc,
		vertex	pd,
		REAL	aheight,
		REAL	bheight,
		REAL	cheight,
		REAL	dheight )

orient3dadapt() [1/2]

return orient3dadapt	(	pa	,
		pb	,
		pc	,
		pd	,
		aheight	,
		bheight	,
		cheight	,
		dheight	,
		permanent	)

orient3dadapt() [2/2]

REAL orient3dadapt	(	vertex	pa,
		vertex	pb,
		vertex	pc,
		vertex	pd,
		REAL	aheight,
		REAL	bheight,
		REAL	cheight,
		REAL	dheight,
		REAL	permanent )

otricopy() [1/6]

otricopy	(	besttri	,
		*	lastedge )

otricopy() [2/6]

otricopy	(	besttri	,
		testtri	)

otricopy() [3/6]

otricopy	(	crosstri	,
		*	searchtri )

otricopy() [4/6]

otricopy	(	hulltri	,
		starttri	)

otricopy() [5/6]

otricopy	(	searchtri1	,
		m->	recenttri )

otricopy() [6/6]

otricopy	(	searchtri2	,
		m->	recenttri )

parsecommandline() [1/3]

parsecommandline	(	1	,
		&	triswitches,
		&	b )

parsecommandline() [2/3]

parsecommandline	(	argc	,
		argv	,
		&	b )

parsecommandline() [3/3]

void parsecommandline	(	int	argc,
		const char **	argv,
		struct behavior *	b )

pc()

return pc

(

xac *bclen2 - xbc *aclen2+

sqrtaclen2 *bclen2 *ablen2

)

plague()

void plague	(	struct mesh *	m,
		struct behavior *	b )

pointlist()

if * pointlist

(

REAL *

)

Definition at line 14377 of file triangle.cpp.

preciselocate() [1/2]

return preciselocate	(	m	,
		b	,
		searchpoint	,
		searchtri	,
		0	)

preciselocate() [2/2]

enum locateresult preciselocate	(	struct mesh *	m,
		struct behavior *	b,
		vertex	searchpoint,
		struct otri *	searchtri,
		int	stopatsubsegment )

precisionerror()

void precisionerror

(

)

Definition at line 13207 of file triangle.cpp.

printf() [1/16]

printf	(	" %6.6g - %-6.6g : %8d | %6.6g - : %8d\n"	,
		ratiotable	[6],
		ratiotable	[7],
		aspecttable	[7],
		ratiotable	[14],
		aspecttable	[15] )

printf() [2/16]

printf

(

" (Aspect ratio is longest edge divided by shortest altitude)\n\n"

)

printf() [3/16]

printf	(	" 1.1547 - %-6.6g : %8d | %6.6g - %-6.6g : %8d\n"	,
		ratiotable	[0],
		aspecttable	[0],
		ratiotable	[7],
		ratiotable	[8],
		aspecttable	[8] )

printf() [4/16]

printf

(

" Angle histogram:\n"

)

printf() [5/16]

printf	(	" Input vertices: %d\n"	,
		m->	invertices )

printf() [6/16]

printf	(	" Mesh edges: %ld\n"	,
		m->	edges )

printf() [7/16]

printf	(	" Mesh exterior boundary edges: %ld\n"	,
		m->	hullsize )

printf() [8/16]

printf	(	" Mesh triangles: %ld\n"	,
		m->triangles.	items )

printf() [9/16]

printf	(	" Shortest altitude: %12.5g | Largest aspect ratio: %8.5g\n\n"	,
		minaltitude	,
		worstaspect	)

printf() [10/16]

printf	(	" Shortest edge: %16.5g | Longest edge: %16.5g\n"	,
		shortest	,
		longest	)

printf() [11/16]

printf	(	" Smallest angle: %15.5g | Largest angle: %15.5g\n\n"	,
		smallestangle	,
		biggestangle	)

printf() [12/16]

printf

(

" Triangle aspect ratio histogram:\n"

)

printf() [13/16]

printf	(	"\n Mesh vertices: %ld\n"	,
		m->vertices.items - m->	undeads )

printf() [14/16]

printf

(

"\n"

)

printf() [15/16]

printf

(

"Mesh quality statistics:\n\n"

)

printf() [16/16]

printf	(	"triangle x%lx with orientation %d:\n"	,
		(unsigned long) t->	tri,
		t->	orient )

printtriangle()

void printtriangle	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	t )

quality_statistics()

void quality_statistics	(	struct mesh *	m,
		struct behavior *	b )

randomnation()

unsigned long randomnation

(

unsigned int

choices

)

randomseed()

return randomseed

(

714025l/choices+

1

)

readholes()

void readholes	(	struct mesh *	m,
		struct behavior *	b,
		FILE *	polyfile,
		char *	polyfilename,
		REAL **	hlist,
		int *	holes,
		REAL **	rlist,
		int *	regions )

readline() [1/2]

char * readline

(

)

readline() [2/2]

char * readline	(	char *	string,
		FILE *	infile,
		char *	infilename )

readnodes()

void readnodes	(	struct mesh *	m,
		struct behavior *	b,
		char *	nodefilename,
		char *	polyfilename,
		FILE **	polyfile )

reconstruct() [1/2]

long reconstruct	(	struct mesh *	m,
		struct behavior *	b,
		char *	elefilename,
		char *	areafilename,
		char *	polyfilename,
		FILE *	polyfile )

reconstruct() [2/2]

int reconstruct	(	struct mesh *	m,
		struct behavior *	b,
		int *	trianglelist,
		REAL *	triangleattriblist,
		REAL *	trianglearealist,
		int	elements,
		int	corners,
		int	attribs,
		int *	segmentlist,
		int *	segmentmarkerlist,
		int	numberofsegments )

regionplague()

void regionplague	(	struct mesh *	m,
		struct behavior *	b,
		REAL	attribute,
		REAL	area )

removebox() [1/2]

return removebox	(	m	,
		b	)

removebox() [2/2]

long removebox	(	struct mesh *	m,
		struct behavior *	b )

removeghosts() [1/2]

return removeghosts	(	m	,
		b	,
		&	hullleft )

removeghosts() [2/2]

long removeghosts	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	startghost )

return() [1/2]

return

(

D

[Dlength - 1]

)

return() [2/2]

return

(

memptr

)

rightofhyperbola()

int rightofhyperbola	(	struct mesh *	m,
		struct otri *	fronttri,
		vertex	newsite )

scale_expansion_zeroelim()

int scale_expansion_zeroelim	(	int	elen,
		REAL *	e,
		REAL	b,
		REAL *	h )

scoutsegment() [1/2]

return scoutsegment	(	m	,
		b	,
		searchtri	,
		endpoint2	,
		newmark	)

scoutsegment() [2/2]

int scoutsegment	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	searchtri,
		vertex	endpoint2,
		int	newmark )

sdissolve()

sdissolve

(

opposubseg

)

segmentintersection() [1/2]

segmentintersection	(	m	,
		b	,
		&	fixuptri,
		&	crosssubseg,
		endpoint2	)

segmentintersection() [2/2]

void segmentintersection	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	splittri,
		struct osub *	splitsubseg,
		vertex	endpoint2 )

segmentlist()

if * segmentlist

(

int *

)

Definition at line 14687 of file triangle.cpp.

setapex() [1/6]

setapex	(	horiz	,
		newvertex	)

setapex() [2/6]

setapex	(	inftri	,
		m->	infvertex3 )

setapex() [3/6]

setapex	(	newbotleft	,
		newvertex	)

setapex() [4/6]

setapex	(	newbotright	,
		newvertex	)

setapex() [5/6]

setapex	(	top	,
		leftvertex	)

setapex() [6/6]

setapex	(	top	,
		rightvertex	)

setdest() [1/8]

setdest	(	baseedge	,
		innerleftdest	)

setdest() [2/8]

setdest	(	inftri	,
		m->	infvertex2 )

setdest() [3/8]

setdest	(	lefttri	,
		secondvertex	)

setdest() [4/8]

setdest	(	newbotleft	,
		botvertex	)

setdest() [5/8]

setdest	(	newbotright	,
		rightvertex	)

setdest() [6/8]

setdest	(	righttri	,
		firstvertex	)

setdest() [7/8]

setdest	(	top	,
		botvertex	)

setdest() [8/8]

setdest	(	top	,
		farvertex	)

setorg() [1/8]

setorg	(	baseedge	,
		innerrightorg	)

setorg() [2/8]

setorg	(	inftri	,
		m->	infvertex1 )

setorg() [3/8]

setorg	(	lefttri	,
		firstvertex	)

setorg() [4/8]

setorg	(	newbotleft	,
		leftvertex	)

setorg() [5/8]

setorg	(	newbotright	,
		botvertex	)

setorg() [6/8]

setorg	(	righttri	,
		secondvertex	)

setorg() [7/8]

setorg	(	top	,
		botvertex	)

setorg() [8/8]

setorg	(	top	,
		farvertex	)

setvertex2tri()

setvertex2tri	(	newvertex	,
		encode *	splittri )

setvertexmark() [1/2]

setvertexmark	(	newvertex	,
		markT *	splitsubseg )

setvertexmark() [2/2]

setvertexmark	(	newvertex	,
		newmark	)

setvertextype() [1/2]

setvertextype	(	newvertex	,
		INPUTVERTEX	)

setvertextype() [2/2]

setvertextype	(	newvertex	,
		SEGMENTVERTEX	)

snextself()

snextself

(

opposubseg

)

splay()

struct splaynode * splay	(	struct mesh *	m,
		struct splaynode *	splaytree,
		vertex	searchpoint,
		struct otri *	searchtri )

splayinsert() [1/2]

return splayinsert	(	m	,
		splay(m, splayroot,(vertex) searchpoint, &dummytri)	,
		newkey	,
		(vertex)	searchpoint )

splayinsert() [2/2]

struct splaynode * splayinsert	(	struct mesh *	m,
		struct splaynode *	splayroot,
		struct otri *	newkey,
		vertex	searchpoint )

Split()

Split	(	b	,
		bhi	,
		blo	)

splitencsegs() [1/2]

splitencsegs	(	m	,
		b	,
		0	)

splitencsegs() [2/2]

void splitencsegs	(	struct mesh *	m,
		struct behavior *	b,
		int	triflaws )

splittriangle()

void splittriangle	(	struct mesh *	m,
		struct behavior *	b,
		struct badtriang *	badtri )

sprintf()

sprintf	(	b->	outnodefilename,
		workstring	,
		meshnumber+	1 )

statistics()

void statistics	(	struct mesh *	m,
		struct behavior *	b )

stpivot()

stpivot	(	testsym	,
		neighbortri	)

strcat() [1/9]

strcat	(	b->	areafilename,
		".area"	)

strcat() [2/9]

strcat	(	b->	edgefilename,
		".edge"	)

strcat() [3/9]

strcat	(	b->	neighborfilename,
		".neigh"	)

strcat() [4/9]

strcat	(	b->	offfilename,
		".off"	)

strcat() [5/9]

strcat	(	b->	outelefilename,
		".ele"	)

strcat() [6/9]

strcat	(	b->	outnodefilename,
		".node"	)

strcat() [7/9]

strcat	(	b->	outpolyfilename,
		".poly"	)

strcat() [8/9]

strcat	(	b->	vedgefilename,
		".v.edge"	)

strcat() [9/9]

strcat	(	b->	vnodefilename,
		".v.node"	)

strcpy() [1/2]

strcpy	(	b->	inpolyfilename,
		b->	innodefilename )

strcpy() [2/2]

strcpy	(	workstring	,
		b->	innodefilename )

subsegdealloc()

void subsegdealloc	(	struct mesh *	m,
		subseg *	dyingsubseg )

subsegtraverse()

subseg * subsegtraverse

(

struct mesh *

m

)

sweeplinedelaunay()

long sweeplinedelaunay	(	struct mesh *	m,
		struct behavior *	b )

sym() [1/8]

sym	(	botleft	,
		botlcasing	)

sym() [2/8]

sym	(	botright	,
		botrcasing	)

sym() [3/8]

sym	(	deadtriangle	,
		dissolveedge	)

sym() [4/8]

sym	(	lefttri	,
		leftcasing	)

sym() [5/8]

sym	(	neartri	,
		fartri	)

sym() [6/8]

sym	(	righttri	,
		rightcasing	)

sym() [7/8]

sym	(	topleft	,
		toplcasing	)

sym() [8/8]

sym	(	topright	,
		toprcasing	)

symself() [1/5]

symself

(

checkedge

)

symself() [2/5]

symself

(

dissolveedge

)

symself() [3/5]

symself

(

hulltri

)

symself() [4/5]

symself

(

nextedge

)

symself() [5/5]

symself

(

searchedge

)

syntax()

void syntax

(

)

Definition at line 1468 of file triangle.cpp.

tallyencs() [1/2]

tallyencs	(	m	,
		b	)

tallyencs() [2/2]

void tallyencs	(	struct mesh *	m,
		struct behavior *	b )

tallyfaces()

void tallyfaces	(	struct mesh *	m,
		struct behavior *	b )

testtriangle()

void testtriangle	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	testtri )

transfernodes()

void transfernodes	(	struct mesh *	m,
		struct behavior *	b,
		REAL *	pointlist,
		REAL *	pointattriblist,
		int *	pointmarkerlist,
		int	numberofpoints,
		int	numberofpointattribs )

triangledealloc() [1/5]

triangledealloc	(	m	,
		deadtriangle.	tri )

triangledealloc() [2/5]

triangledealloc	(	m	,
		finaledge.	tri )

triangledealloc() [3/5]

triangledealloc	(	m	,
		lefttri.	tri )

triangledealloc() [4/5]

triangledealloc	(	m	,
		righttri.	tri )

triangledealloc() [5/5]

void triangledealloc	(	struct mesh *	m,
		triangle *	dyingtriangle )

triangledeinit()

void triangledeinit	(	struct mesh *	m,
		struct behavior *	b )

triangleinit()

void triangleinit

(

struct mesh *

m

)

trianglelist()

if * trianglelist

(

int *

)

Definition at line 14542 of file triangle.cpp.

triangletraverse()

triangle * triangletraverse

(

struct mesh *

m

)

triangulate()

void triangulate	(	const char *	triswitches,
		struct triangulateio *	in,
		struct triangulateio *	out,
		struct triangulateio *	vorout )

triangulatepolygon()

void triangulatepolygon	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	firstedge,
		struct otri *	lastedge,
		int	edgecount,
		int	doflip,
		int	triflaws )

triexit()

void triexit

(

int

status

)

trifree() [1/3]

trifree

(

(VOID *) m->

dummytribase

)

trifree() [2/3]

trifree

(

(VOID *)

sortarray

)

trifree() [3/3]

void trifree

(

void *

memptr

)

trimalloc()

VOID * trimalloc

(

int

size

)

triunsuitable() [1/2]

int triunsuitable

(

)

triunsuitable() [2/2]

int triunsuitable	(	vertex	triorg,
		vertex	tridest,
		vertex	triapex,
		REAL	)

tspivot() [1/4]

tspivot	(	crosstri	,
		crosssubseg	)

tspivot() [2/4]

tspivot	(	lefttri	,
		leftsubseg	)

tspivot() [3/4]

tspivot	(	neartri	,
		faredge	)

tspivot() [4/4]

tspivot	(	righttri	,
		rightsubseg	)

Two_Diff_Tail() [1/13]

Two_Diff_Tail	(	aheight	,
		dheight	,
		adheight	,
		adheighttail	)

Two_Diff_Tail() [2/13]

Two_Diff_Tail	(	bheight	,
		dheight	,
		bdheight	,
		bdheighttail	)

Two_Diff_Tail() [3/13]

Two_Diff_Tail	(	cheight	,
		dheight	,
		cdheight	,
		cdheighttail	)

Two_Diff_Tail() [4/13]

Two_Diff_Tail	(	pa	[0],
		pc	[0],
		acx	,
		acxtail	)

Two_Diff_Tail() [5/13]

Two_Diff_Tail	(	pa	[0],
		pd	[0],
		adx	,
		adxtail	)

Two_Diff_Tail() [6/13]

Two_Diff_Tail	(	pa	[1],
		pc	[1],
		acy	,
		acytail	)

Two_Diff_Tail() [7/13]

Two_Diff_Tail	(	pa	[1],
		pd	[1],
		ady	,
		adytail	)

Two_Diff_Tail() [8/13]

Two_Diff_Tail	(	pb	[0],
		pc	[0],
		bcx	,
		bcxtail	)

Two_Diff_Tail() [9/13]

Two_Diff_Tail	(	pb	[0],
		pd	[0],
		bdx	,
		bdxtail	)

Two_Diff_Tail() [10/13]

Two_Diff_Tail	(	pb	[1],
		pc	[1],
		bcy	,
		bcytail	)

Two_Diff_Tail() [11/13]

Two_Diff_Tail	(	pb	[1],
		pd	[1],
		bdy	,
		bdytail	)

Two_Diff_Tail() [12/13]

Two_Diff_Tail	(	pc	[0],
		pd	[0],
		cdx	,
		cdxtail	)

Two_Diff_Tail() [13/13]

Two_Diff_Tail	(	pc	[1],
		pd	[1],
		cdy	,
		cdytail	)

Two_Product() [1/14]

Two_Product	(	acx	,
		bcy	,
		detleft	,
		detlefttail	)

Two_Product() [2/14]

Two_Product	(	acx	,
		bcytail	,
		s1	,
		s0	)

Two_Product() [3/14]

Two_Product	(	acxtail	,
		bcy	,
		s1	,
		s0	)

Two_Product() [4/14]

Two_Product	(	acxtail	,
		bcytail	,
		s1	,
		s0	)

Two_Product() [5/14]

Two_Product	(	acy	,
		bcx	,
		detright	,
		detrighttail	)

Two_Product() [6/14]

Two_Product	(	acy	,
		bcxtail	,
		t1	,
		t0	)

Two_Product() [7/14]

Two_Product	(	acytail	,
		bcx	,
		t1	,
		t0	)

Two_Product() [8/14]

Two_Product	(	acytail	,
		bcxtail	,
		t1	,
		t0	)

Two_Product() [9/14]

Two_Product	(	adx	,
		bdy	,
		adxbdy1	,
		adxbdy0	)

Two_Product() [10/14]

Two_Product	(	adx	,
		cdy	,
		adxcdy1	,
		adxcdy0	)

Two_Product() [11/14]

Two_Product	(	bdx	,
		ady	,
		bdxady1	,
		bdxady0	)

Two_Product() [12/14]

Two_Product	(	bdx	,
		cdy	,
		bdxcdy1	,
		bdxcdy0	)

Two_Product() [13/14]

Two_Product	(	cdx	,
		ady	,
		cdxady1	,
		cdxady0	)

Two_Product() [14/14]

Two_Product	(	cdx	,
		bdy	,
		cdxbdy1	,
		cdxbdy0	)

Two_Product_Presplit()

Two_Product_Presplit	(	e	[0],
		b	,
		bhi	,
		blo	,
		Q	,
		hh	)

Two_Two_Diff() [1/5]

Two_Two_Diff	(	adxbdy1	,
		adxbdy0	,
		bdxady1	,
		bdxady0	,
		ab3	,
		ab	[2],
		ab	[1],
		ab	[0] )

Two_Two_Diff() [2/5]

Two_Two_Diff	(	bdxcdy1	,
		bdxcdy0	,
		cdxbdy1	,
		cdxbdy0	,
		bc3	,
		bc	[2],
		bc	[1],
		bc	[0] )

Two_Two_Diff() [3/5]

Two_Two_Diff	(	cdxady1	,
		cdxady0	,
		adxcdy1	,
		adxcdy0	,
		ca3	,
		ca	[2],
		ca	[1],
		ca	[0] )

Two_Two_Diff() [4/5]

Two_Two_Diff	(	detleft	,
		detlefttail	,
		detright	,
		detrighttail	,
		B3	,
		B	[2],
		B	[1],
		B	[0] )

Two_Two_Diff() [5/5]

Two_Two_Diff	(	s1	,
		s0	,
		t1	,
		t0	,
		u3	,
		u	[2],
		u	[1],
		u	[0] )

undovertex()

void undovertex	(	struct mesh *	m,
		struct behavior *	b )

unflip()

void unflip	(	struct mesh *	m,
		struct behavior *	b,
		struct otri *	flipedge )

vedgelist()

if * vedgelist

(

int *

)

Definition at line 15067 of file triangle.cpp.

vertex()

return vertex

(

foundvertex+m->vertices.itembytes *

number - current

)

vertexdealloc() [1/2]

vertexdealloc	(	m	,
		delvertex	)

vertexdealloc() [2/2]

void vertexdealloc	(	struct mesh *	m,
		vertex	dyingvertex )

vertexmedian() [1/2]

vertexmedian	(	sortarray	,
		arraysize	,
		divider	,
		axis	)

vertexmedian() [2/2]

void vertexmedian	(	vertex *	sortarray,
		int	arraysize,
		int	median,
		int	axis )

vertexsort() [1/2]

vertexsort	(	sortarray	,
		m->	invertices )

vertexsort() [2/2]

void vertexsort	(	vertex *	sortarray,
		int	arraysize )

vertextraverse()

vertex vertextraverse

(

struct mesh *

m

)

vnormlist()

if * vnormlist

(

REAL *

)

Definition at line 15072 of file triangle.cpp.

vpointattriblist()

if * vpointattriblist

(

REAL *

)

Definition at line 15000 of file triangle.cpp.

vpointlist()

if * vpointlist

(

REAL *

)

Definition at line 14995 of file triangle.cpp.

while() [1/35]

while

(

!

done

)

while() [2/35]

while

(

!farrightflag &&

rightofhyperbolam, searchtri, searchvertex

)

Definition at line 10776 of file triangle.cpp.

while() [3/35]

while

(

!otriequal *,

countingtri

)

Definition at line 8983 of file triangle.cpp.

while() [4/35]

while

(

!

otriequaldissolveedge, *startghost

)

while() [5/35]

while

(

!

otriequalhulltri, starttri

)

while() [6/35]

while

(

!

otriequalnextedge, finaledge

)

Definition at line 10172 of file triangle.cpp.

while() [7/35]

while

(

*!='\0 'result &&*!='# 'result &&*!=' 'result &&*!='\ '

t

)

Definition at line 13859 of file triangle.cpp.

while() [8/35]

while

(

*!='\0 'result &&*!='# 'result &&*!='. 'result &&*!='+ 'result &&*!='- 'result &&

(*result< '0')||(*result > '9')

)

Definition at line 13824 of file triangle.cpp.

while() [9/35]

while

(

*=='# 'result||*=='\0 '

result

)

while() [10/35]

while

(

(firstvertex[0]==secondvertex[0]) &&(firstvertex[1]==secondvertex[1])

)

while() [11/35]

while

(

(m->badsubsegs.items > 0) &&(m->steinerleft !=0)

)

Definition at line 13265 of file triangle.cpp.

while() [12/35]

while

(

1

)

Definition at line 7523 of file triangle.cpp.

while() [13/35]

while

(

changemade

)

while() [14/35]

while

(

deadsubseg(newsubseg)

)

while() [15/35]

while

(

deadtri(newtriangle)

)

while() [16/35]

while

(

)

Definition at line 5017 of file triangle.cpp.

while() [17/35]

while	(	heapsize	,
		0	)

Definition at line 10872 of file triangle.cpp.

while() [18/35]

while

(

leftflag

)

Definition at line 11632 of file triangle.cpp.

while() [19/35]

while

(

leftright->rchild !

= (struct splaynode *) NULL

)

Definition at line 10663 of file triangle.cpp.

while() [20/35]

while	(	length	,
		2.	0 )

Definition at line 6942 of file triangle.cpp.

while() [21/35]

while

(

m->lastflip !

= (struct flipstacker *) NULL

)

Definition at line 9075 of file triangle.cpp.

while() [22/35]

while

(

newseg->

subsegorg = =(vertex) NULL

)

while() [23/35]

while

(

nexttri.tri !

= m->dummytri

)

Definition at line 12390 of file triangle.cpp.

while() [24/35]

while

(

notdone

)

Definition at line 10292 of file triangle.cpp.

while() [25/35]

while

(

opposubseg.ss !

= m->dummysub

)

while() [26/35]

while

(

rightflag

)

Definition at line 11647 of file triangle.cpp.

while() [27/35]

while

(

SAMPLEFACTOR *m->samples *m->samples *m->samples< m->triangles.

items

)

Definition at line 7700 of file triangle.cpp.

while() [28/35]

while

(

splitsubseg->ss !

= m->dummysub

)

while() [29/35]

while

(

subsegloop.ss !

= (subseg *) NULL

)

Definition at line 13190 of file triangle.cpp.

while() [30/35]

while	(	totalsamplesleft	,
		0	)

Definition at line 7719 of file triangle.cpp.

while() [31/35]

while

(

triangleloop.tri !

= (triangle *) NULL

)

Definition at line 6721 of file triangle.cpp.

while() [32/35]

while

(

vertexloop !

= (vertex) NULL

)

Definition at line 10243 of file triangle.cpp.

while() [33/35]

while

(

vertextype(newvertex)

= =DEADVERTEX

)

while() [34/35]

while

(

virusloop !

= (triangle **) NULL

)

Definition at line 12686 of file triangle.cpp.

while() [35/35]

while

(

workstring !

[j] = '\0'

)

Definition at line 3568 of file triangle.cpp.

writeedges() [1/2]

void writeedges	(	struct mesh *	m,
		struct behavior *	b,
		char *	edgefilename,
		int	argc,
		char **	argv )

writeedges() [2/2]

void writeedges	(	struct mesh *	m,
		struct behavior *	b,
		int **	edgelist,
		int **	edgemarkerlist )

writeelements() [1/2]

void writeelements	(	struct mesh *	m,
		struct behavior *	b,
		char *	elefilename,
		int	argc,
		char **	argv )

writeelements() [2/2]

void writeelements	(	struct mesh *	m,
		struct behavior *	b,
		int **	trianglelist,
		REAL **	triangleattriblist )

writeneighbors() [1/2]

void writeneighbors	(	struct mesh *	m,
		struct behavior *	b,
		char *	neighborfilename,
		int	argc,
		char **	argv )

writeneighbors() [2/2]

void writeneighbors	(	struct mesh *	m,
		struct behavior *	b,
		int **	neighborlist )

writenodes() [1/2]

void writenodes	(	struct mesh *	m,
		struct behavior *	b,
		char *	nodefilename,
		int	argc,
		char **	argv )

writenodes() [2/2]

void writenodes	(	struct mesh *	m,
		struct behavior *	b,
		REAL **	pointlist,
		REAL **	pointattriblist,
		int **	pointmarkerlist )

writeoff()

void writeoff	(	struct mesh *	m,
		struct behavior *	b,
		char *	offfilename,
		int	argc,
		char **	argv )

writepoly() [1/2]

void writepoly	(	struct mesh *	m,
		struct behavior *	b,
		char *	polyfilename,
		REAL *	holelist,
		int	holes,
		REAL *	regionlist,
		int	regions,
		int	argc,
		char **	argv )

writepoly() [2/2]

void writepoly	(	struct mesh *	m,
		struct behavior *	b,
		int **	segmentlist,
		int **	segmentmarkerlist )

writevoronoi() [1/2]

void writevoronoi	(	struct mesh *	m,
		struct behavior *	b,
		char *	vnodefilename,
		char *	vedgefilename,
		int	argc,
		char **	argv )

writevoronoi() [2/2]

void writevoronoi	(	struct mesh *	m,
		struct behavior *	b,
		REAL **	vpointlist,
		REAL **	vpointattriblist,
		int **	vpointmarkerlist,
		int **	vedgelist,
		int **	vedgemarkerlist,
		REAL **	vnormlist )

Variable Documentation

_0

REAL _0

Definition at line 5180 of file triangle.cpp.

_i

INEXACT REAL _i

Definition at line 5179 of file triangle.cpp.

_j

INEXACT REAL _j

Definition at line 5179 of file triangle.cpp.

_k

INEXACT REAL _k

Definition at line 6035 of file triangle.cpp.

aa

REAL aa[4]

Definition at line 5341 of file triangle.cpp.

aa3

INEXACT REAL aa3

Definition at line 5342 of file triangle.cpp.

ab

REAL ab = ab3

Definition at line 5324 of file triangle.cpp.

ab3

INEXACT REAL ab3

Definition at line 5325 of file triangle.cpp.

abdet

REAL abdet

Definition at line 5332 of file triangle.cpp.

abig

INEXACT REAL abig

Definition at line 5074 of file triangle.cpp.

ablen

int ablen = fast_expansion_sum_zeroelim(alen, adet, blen, bdet, abdet)

Definition at line 5333 of file triangle.cpp.

ablen2

ablen2 = xab * xab + yab * yab

Definition at line 10504 of file triangle.cpp.

abt

REAL abt

Definition at line 5364 of file triangle.cpp.

abtlen

int abtlen = fast_expansion_sum_zeroelim(at_blen, at_b, bt_alen, bt_a, abt)

Definition at line 5365 of file triangle.cpp.

abtt

REAL abtt[4]

Definition at line 5366 of file triangle.cpp.

abtt3

INEXACT REAL abtt3

Definition at line 5368 of file triangle.cpp.

abttlen

int abttlen

Definition at line 5367 of file triangle.cpp.

aclen2

REAL aclen2

Initial value:

{
  REAL xac, yac, xbc, ybc, xab, yab

Definition at line 10504 of file triangle.cpp.

acutebiggest

acutebiggest = 1

Definition at line 15373 of file triangle.cpp.

acutedest

int acutedest

Definition at line 13257 of file triangle.cpp.

acutedest2

int acutedest2

Definition at line 13257 of file triangle.cpp.

acuteorg

int acuteorg

Definition at line 13257 of file triangle.cpp.

acuteorg2

int acuteorg2

Definition at line 13257 of file triangle.cpp.

acx

acx = (REAL) (pa[0] - pc[0])

Definition at line 5182 of file triangle.cpp.

acxtail

REAL acxtail

Initial value:

{
  INEXACT REAL acx, acy, bcx, bcy

Definition at line 5161 of file triangle.cpp.

acy

acy = (REAL) (pa[1] - pc[1])

Definition at line 5184 of file triangle.cpp.

acytail

REAL acytail

Definition at line 5161 of file triangle.cpp.

adet

REAL adet

Definition at line 5326 of file triangle.cpp.

adheight

adheight = (REAL) (aheight - dheight)

Definition at line 6044 of file triangle.cpp.

adheighttail

REAL adheighttail

Definition at line 6004 of file triangle.cpp.

adx

adx = (REAL) (pa[0] - pd[0])

Definition at line 5380 of file triangle.cpp.

adxadx0

REAL adxadx0

Definition at line 5340 of file triangle.cpp.

adxadx1

INEXACT REAL adxadx1

Definition at line 5339 of file triangle.cpp.

adxbdy

REAL adxbdy = adx * bdy

Definition at line 5901 of file triangle.cpp.

adxbdy0

REAL adxbdy0

Definition at line 5323 of file triangle.cpp.

adxbdy1

INEXACT REAL adxbdy1

Definition at line 5322 of file triangle.cpp.

adxcdy

REAL adxcdy = adx * cdy

Definition at line 5901 of file triangle.cpp.

adxcdy0

REAL adxcdy0

Definition at line 5323 of file triangle.cpp.

adxcdy1

INEXACT REAL adxcdy1

Definition at line 5322 of file triangle.cpp.

adxt_bdy0

REAL adxt_bdy0

Definition at line 6013 of file triangle.cpp.

adxt_bdy1

INEXACT REAL adxt_bdy1

Definition at line 6011 of file triangle.cpp.

adxt_bdyt0

REAL adxt_bdyt0

Definition at line 6023 of file triangle.cpp.

adxt_bdyt1

INEXACT REAL adxt_bdyt1

Definition at line 6021 of file triangle.cpp.

adxt_cdy0

REAL adxt_cdy0

Definition at line 6013 of file triangle.cpp.

adxt_cdy1

INEXACT REAL adxt_cdy1

Definition at line 6011 of file triangle.cpp.

adxt_cdyt0

REAL adxt_cdyt0

Definition at line 6023 of file triangle.cpp.

adxt_cdyt1

INEXACT REAL adxt_cdyt1

Definition at line 6021 of file triangle.cpp.

adxtail

REAL adxtail

Definition at line 5338 of file triangle.cpp.

ady

ady = (REAL) (pa[1] - pd[1])

Definition at line 5383 of file triangle.cpp.

adyady0

REAL adyady0

Definition at line 5340 of file triangle.cpp.

adyady1

INEXACT REAL adyady1

Definition at line 5339 of file triangle.cpp.

adyt_bdx0

REAL adyt_bdx0

Definition at line 6017 of file triangle.cpp.

adyt_bdx1

INEXACT REAL adyt_bdx1

Definition at line 6015 of file triangle.cpp.

adyt_cdx0

REAL adyt_cdx0

Definition at line 6017 of file triangle.cpp.

adyt_cdx1

INEXACT REAL adyt_cdx1

Definition at line 6015 of file triangle.cpp.

adytail

REAL adytail

Definition at line 5338 of file triangle.cpp.

ahead

ahead = counterclockwise(m, b, torg, tdest, searchpoint)

Definition at line 7655 of file triangle.cpp.

aheight

REAL aheight

Definition at line 5974 of file triangle.cpp.

ahi

REAL ahi

Definition at line 5075 of file triangle.cpp.

alen

int alen = fast_expansion_sum_zeroelim(axxbclen, axxbc, ayybclen, ayybc, adet)

Definition at line 5327 of file triangle.cpp.

alift

alift = adx * adx + ady * ady

Definition at line 5902 of file triangle.cpp.

alignptr

unsigned long alignptr = (unsigned long) m->dummytribase

Definition at line 4207 of file triangle.cpp.

alo

REAL alo

Definition at line 5075 of file triangle.cpp.

angle

angle = dxod * dxda + dyod * dyda

Definition at line 7231 of file triangle.cpp.

angletable

int angletable[18]

Definition at line 15369 of file triangle.cpp.

aodist

aodist = xao * xao + yao * yao

Definition at line 6537 of file triangle.cpp.

apexlen

apexlen = dxod2 + dyod2

Definition at line 7230 of file triangle.cpp.

area

REAL area

Definition at line 1372 of file triangle.cpp.

areaboundindex

m areaboundindex = m->elemattribindex + m->eextras + b->regionattrib

Definition at line 4337 of file triangle.cpp.

areaelements

int areaelements

Definition at line 11141 of file triangle.cpp.

areafile

FILE* areafile

Definition at line 11138 of file triangle.cpp.

areafilename

char * areafilename

Definition at line 11121 of file triangle.cpp.

argc

int argv int argc

Definition at line 3287 of file triangle.cpp.

argv

char ** argv

Definition at line 3286 of file triangle.cpp.

around

REAL around

Definition at line 4976 of file triangle.cpp.

aroundvertex

int aroundvertex

Definition at line 11164 of file triangle.cpp.

arraysize

int arraysize

Definition at line 9207 of file triangle.cpp.

aspectindex

int aspectindex

Definition at line 15371 of file triangle.cpp.

aspecttable

int aspecttable[16]

Definition at line 15370 of file triangle.cpp.

at_b

REAL at_b[4]

Definition at line 6008 of file triangle.cpp.

at_blarge

INEXACT REAL at_blarge

Definition at line 6005 of file triangle.cpp.

at_blen

int at_blen

Definition at line 6009 of file triangle.cpp.

at_c

REAL at_c[4]

Definition at line 6008 of file triangle.cpp.

at_clarge

INEXACT REAL at_clarge

Definition at line 6005 of file triangle.cpp.

at_clen

int at_clen

Definition at line 6009 of file triangle.cpp.

attrib

REAL attrib

Definition at line 8234 of file triangle.cpp.

attribindex

int attribindex

Initial value:

{
#ifdef TRILIBRARY
  int vertexindex

Definition at line 11135 of file triangle.cpp.

attribs

int attribs

Definition at line 11100 of file triangle.cpp.

attribute

REAL attribute

Definition at line 12872 of file triangle.cpp.

avirt

REAL avirt

Definition at line 4976 of file triangle.cpp.

axbc

REAL axbc[8]

Definition at line 5326 of file triangle.cpp.

axbclen

axbclen = scale_expansion_zeroelim(4, bc, adx, axbc)

Definition at line 5327 of file triangle.cpp.

axis

int axis

Definition at line 9283 of file triangle.cpp.

axtbb

REAL axtbb[8]

Definition at line 5351 of file triangle.cpp.

axtbblen

int axtbblen

Definition at line 5352 of file triangle.cpp.

axtbc

REAL axtbc[8]

Definition at line 5357 of file triangle.cpp.

axtbclen

int axtbclen

Definition at line 5358 of file triangle.cpp.

axtbct

REAL axtbct[16]

Definition at line 5359 of file triangle.cpp.

axtbctlen

int axtbctlen

Definition at line 5360 of file triangle.cpp.

axtbctt

REAL axtbctt[8]

Definition at line 5361 of file triangle.cpp.

axtbcttlen

int axtbcttlen

Definition at line 5363 of file triangle.cpp.

axtcc

REAL axtcc[8]

Definition at line 5351 of file triangle.cpp.

axtcclen

int axtcclen

Definition at line 5352 of file triangle.cpp.

axxbc

REAL axxbc[16]

Definition at line 5326 of file triangle.cpp.

axxbclen

axxbclen = scale_expansion_zeroelim(axbclen, axbc, adx, axxbc)

Definition at line 5327 of file triangle.cpp.

aybc

REAL aybc[8]

Definition at line 5326 of file triangle.cpp.

aybclen

aybclen = scale_expansion_zeroelim(4, bc, ady, aybc)

Definition at line 5327 of file triangle.cpp.

aytbb

REAL aytbb[8]

Definition at line 5351 of file triangle.cpp.

aytbblen

int aytbblen

Definition at line 5352 of file triangle.cpp.

aytbc

REAL aytbc[8]

Definition at line 5357 of file triangle.cpp.

aytbclen

int aytbclen

Definition at line 5358 of file triangle.cpp.

aytbct

REAL aytbct[16]

Definition at line 5359 of file triangle.cpp.

aytbctlen

int aytbctlen

Definition at line 5360 of file triangle.cpp.

aytbctt

REAL aytbctt[8]

Definition at line 5361 of file triangle.cpp.

aytbcttlen

int aytbcttlen

Definition at line 5363 of file triangle.cpp.

aytcc

REAL aytcc[8]

Definition at line 5351 of file triangle.cpp.

aytcclen

int aytcclen

Definition at line 5352 of file triangle.cpp.

ayybc

REAL ayybc[16]

Definition at line 5326 of file triangle.cpp.

ayybclen

ayybclen = scale_expansion_zeroelim(aybclen, aybc, ady, ayybc)

Definition at line 5327 of file triangle.cpp.

B

B[3] = B3

Definition at line 5165 of file triangle.cpp.

b

struct behavior b

Definition at line 3289 of file triangle.cpp.

B3

INEXACT REAL B3

Definition at line 5166 of file triangle.cpp.

badedge

int badedge

Definition at line 9449 of file triangle.cpp.

badtri

struct badtriang * badtri

Definition at line 6910 of file triangle.cpp.

bapex

vertex bapex

Definition at line 13496 of file triangle.cpp.

base1

base1 = tapex

Definition at line 7225 of file triangle.cpp.

base2

base2 = torg

Definition at line 7225 of file triangle.cpp.

baseedge

struct otri baseedge

Initial value:

{
  struct otri leftcand, rightcand

Definition at line 9435 of file triangle.cpp.

bb

REAL bb[4]

Definition at line 5341 of file triangle.cpp.

bb3

INEXACT REAL bb3

Definition at line 5342 of file triangle.cpp.

bc

REAL bc = bc3

Definition at line 5324 of file triangle.cpp.

bc3

INEXACT REAL bc3

Definition at line 5325 of file triangle.cpp.

bclen2

REAL bclen2 = xbc * xbc + ybc * ybc

Definition at line 10504 of file triangle.cpp.

bct

REAL bct

Definition at line 5364 of file triangle.cpp.

bctlen

int bctlen

Definition at line 5365 of file triangle.cpp.

bctt

REAL bctt[4]

Definition at line 5366 of file triangle.cpp.

bctt3

INEXACT REAL bctt3

Definition at line 5368 of file triangle.cpp.

bcttlen

int bcttlen

Definition at line 5367 of file triangle.cpp.

bcx

bcx = (REAL) (pb[0] - pc[0])

Definition at line 5183 of file triangle.cpp.

bcxtail

REAL bcxtail

Definition at line 5161 of file triangle.cpp.

bcy

bcy = (REAL) (pb[1] - pc[1])

Definition at line 5185 of file triangle.cpp.

bcytail

REAL bcytail

Definition at line 5161 of file triangle.cpp.

bdest

vertex bdest

Definition at line 13496 of file triangle.cpp.

bdet

REAL bdet

Definition at line 5328 of file triangle.cpp.

bdheight

bdheight = (REAL) (bheight - dheight)

Definition at line 6045 of file triangle.cpp.

bdheighttail

REAL bdheighttail

Definition at line 6004 of file triangle.cpp.

bdx

bdx = (REAL) (pb[0] - pd[0])

Definition at line 5381 of file triangle.cpp.

bdxady

REAL bdxady = bdx * ady

Definition at line 5901 of file triangle.cpp.

bdxady0

REAL bdxady0

Definition at line 5323 of file triangle.cpp.

bdxady1

INEXACT REAL bdxady1

Definition at line 5322 of file triangle.cpp.

bdxbdx0

REAL bdxbdx0

Definition at line 5340 of file triangle.cpp.

bdxbdx1

INEXACT REAL bdxbdx1

Definition at line 5339 of file triangle.cpp.

bdxcdy

REAL bdxcdy

Initial value:

{
  REAL adx, bdx, cdx, ady, bdy, cdy

Definition at line 5901 of file triangle.cpp.

bdxcdy0

REAL bdxcdy0

Definition at line 5323 of file triangle.cpp.

bdxcdy1

INEXACT REAL bdxcdy1

Definition at line 5322 of file triangle.cpp.

bdxt_ady0

REAL bdxt_ady0

Definition at line 6013 of file triangle.cpp.

bdxt_ady1

INEXACT REAL bdxt_ady1

Definition at line 6011 of file triangle.cpp.

bdxt_adyt0

REAL bdxt_adyt0

Definition at line 6023 of file triangle.cpp.

bdxt_adyt1

INEXACT REAL bdxt_adyt1

Definition at line 6021 of file triangle.cpp.

bdxt_cdy0

REAL bdxt_cdy0

Definition at line 6012 of file triangle.cpp.

bdxt_cdy1

INEXACT REAL bdxt_cdy1

Definition at line 6010 of file triangle.cpp.

bdxt_cdyt0

REAL bdxt_cdyt0

Definition at line 6022 of file triangle.cpp.

bdxt_cdyt1

INEXACT REAL bdxt_cdyt1

Definition at line 6020 of file triangle.cpp.

bdxtail

REAL bdxtail

Definition at line 5338 of file triangle.cpp.

bdy

bdy = (REAL) (pb[1] - pd[1])

Definition at line 5384 of file triangle.cpp.

bdybdy0

REAL bdybdy0

Definition at line 5340 of file triangle.cpp.

bdybdy1

INEXACT REAL bdybdy1

Definition at line 5339 of file triangle.cpp.

bdyt_adx0

REAL bdyt_adx0

Definition at line 6017 of file triangle.cpp.

bdyt_adx1

INEXACT REAL bdyt_adx1

Definition at line 6015 of file triangle.cpp.

bdyt_cdx0

REAL bdyt_cdx0

Definition at line 6016 of file triangle.cpp.

bdyt_cdx1

INEXACT REAL bdyt_cdx1

Definition at line 6014 of file triangle.cpp.

bdytail

REAL bdytail

Definition at line 5338 of file triangle.cpp.

bestnumber

bestnumber = 1

Definition at line 8875 of file triangle.cpp.

besttri

struct otri besttri

Initial value:

{
  struct otri testtri

Definition at line 8870 of file triangle.cpp.

bestvertex

vertex bestvertex

Definition at line 8874 of file triangle.cpp.

bheight

REAL bheight

Definition at line 5974 of file triangle.cpp.

bhi

REAL bhi

Definition at line 5075 of file triangle.cpp.

biggestangle

biggestangle = 2.0

Definition at line 15367 of file triangle.cpp.

biggestarea

biggestarea = 0.0

Definition at line 15362 of file triangle.cpp.

blen

int blen = fast_expansion_sum_zeroelim(bxxcalen, bxxca, byycalen, byyca, bdet)

Definition at line 5329 of file triangle.cpp.

blift

blift = bdx * bdx + bdy * bdy

Definition at line 5902 of file triangle.cpp.

blo

REAL blo

Definition at line 5075 of file triangle.cpp.

borg

vertex borg

Initial value:

{
  struct otri badotri

Definition at line 13496 of file triangle.cpp.

botrcasing

struct otri botlcasing botrcasing

Definition at line 7925 of file triangle.cpp.

botright

struct otri botleft botright

Definition at line 8216 of file triangle.cpp.

botrsubseg

struct osub botlsubseg botrsubseg

Definition at line 7927 of file triangle.cpp.

bottommost

struct otri bottommost

Definition at line 10758 of file triangle.cpp.

botvertex

vertex botvertex

Definition at line 7929 of file triangle.cpp.

boundmarker

int boundmarker

Definition at line 11163 of file triangle.cpp.

brokensubseg

struct osub brokensubseg

Initial value:

{
  struct otri searchtri1, searchtri2

Definition at line 8225 of file triangle.cpp.

bround

REAL bround

Definition at line 4976 of file triangle.cpp.

bt_a

REAL bt_a[4]

Definition at line 6008 of file triangle.cpp.

bt_alarge

INEXACT REAL bt_alarge

Definition at line 6006 of file triangle.cpp.

bt_alen

int bt_alen

Definition at line 6009 of file triangle.cpp.

bt_c

REAL bt_c[4]

Definition at line 6008 of file triangle.cpp.

bt_clarge

INEXACT REAL bt_clarge

Definition at line 6006 of file triangle.cpp.

bt_clen

int bt_clen

Definition at line 6009 of file triangle.cpp.

bvirt

INEXACT REAL bvirt

Definition at line 4975 of file triangle.cpp.

bxca

REAL bxca[8]

Definition at line 5328 of file triangle.cpp.

bxcalen

bxcalen = scale_expansion_zeroelim(4, ca, bdx, bxca)

Definition at line 5329 of file triangle.cpp.

bxtaa

REAL bxtaa[8]

Definition at line 5353 of file triangle.cpp.

bxtaalen

int bxtaalen

Definition at line 5354 of file triangle.cpp.

bxtca

REAL bxtca[8]

Definition at line 5357 of file triangle.cpp.

bxtcalen

int bxtcalen

Definition at line 5358 of file triangle.cpp.

bxtcat

REAL bxtcat[16]

Definition at line 5359 of file triangle.cpp.

bxtcatlen

int bxtcatlen

Definition at line 5360 of file triangle.cpp.

bxtcatt

REAL bxtcatt[8]

Definition at line 5361 of file triangle.cpp.

bxtcattlen

int bxtcattlen

Definition at line 5363 of file triangle.cpp.

bxtcc

REAL bxtcc[8]

Definition at line 5353 of file triangle.cpp.

bxtcclen

int bxtcclen

Definition at line 5354 of file triangle.cpp.

bxxca

REAL bxxca[16]

Definition at line 5328 of file triangle.cpp.

bxxcalen

bxxcalen = scale_expansion_zeroelim(bxcalen, bxca, bdx, bxxca)

Definition at line 5329 of file triangle.cpp.

byca

REAL byca[8]

Definition at line 5328 of file triangle.cpp.

bycalen

bycalen = scale_expansion_zeroelim(4, ca, bdy, byca)

Definition at line 5329 of file triangle.cpp.

bytaa

REAL bytaa[8]

Definition at line 5353 of file triangle.cpp.

bytaalen

int bytaalen

Definition at line 5354 of file triangle.cpp.

bytca

REAL bytca[8]

Definition at line 5357 of file triangle.cpp.

bytcalen

int bytcalen

Definition at line 5358 of file triangle.cpp.

bytcat

REAL bytcat[16]

Definition at line 5359 of file triangle.cpp.

bytcatlen

int bytcatlen

Definition at line 5360 of file triangle.cpp.

bytcatt

REAL bytcatt[8]

Definition at line 5362 of file triangle.cpp.

bytcattlen

int bytcattlen

Definition at line 5363 of file triangle.cpp.

bytcc

REAL bytcc[8]

Definition at line 5353 of file triangle.cpp.

bytcclen

int bytcclen

Definition at line 5354 of file triangle.cpp.

byyca

REAL byyca[16]

Definition at line 5328 of file triangle.cpp.

byycalen

byycalen = scale_expansion_zeroelim(bycalen, byca, bdy, byyca)

Definition at line 5329 of file triangle.cpp.

c

INEXACT REAL c

Definition at line 5073 of file triangle.cpp.

C1

REAL C1[8]

Definition at line 5165 of file triangle.cpp.

C1length

C1length = fast_expansion_sum_zeroelim(4, B, 4, u, C1)

Definition at line 5167 of file triangle.cpp.

C2

REAL C2[12]

Definition at line 5165 of file triangle.cpp.

C2length

C2length = fast_expansion_sum_zeroelim(C1length, C1, 4, u, C2)

Definition at line 5167 of file triangle.cpp.

ca

REAL ca = ca3

Definition at line 5324 of file triangle.cpp.

ca3

INEXACT REAL ca3

Definition at line 5325 of file triangle.cpp.

cat

REAL cat

Definition at line 5364 of file triangle.cpp.

catlen

int catlen = fast_expansion_sum_zeroelim(ct_alen, ct_a, at_clen, at_c, cat)

Definition at line 5365 of file triangle.cpp.

catt

REAL catt[4]

Definition at line 5366 of file triangle.cpp.

catt3

INEXACT REAL catt3

Definition at line 5368 of file triangle.cpp.

cattlen

int cattlen

Definition at line 5367 of file triangle.cpp.

cc

REAL cc[4]

Definition at line 5341 of file triangle.cpp.

cc3

INEXACT REAL cc3

Definition at line 5342 of file triangle.cpp.

ccwabc

ccwabc = counterclockwise(m, b, pa, pb, pc)

Definition at line 10499 of file triangle.cpp.

ccwerrboundA

REAL ccwerrboundA

Definition at line 649 of file triangle.cpp.

ccwerrboundB

REAL ccwerrboundB

Definition at line 649 of file triangle.cpp.

ccwerrboundC

REAL ccwerrboundC

Definition at line 649 of file triangle.cpp.

cdet

REAL cdet

Definition at line 5330 of file triangle.cpp.

cdheight

cdheight = (REAL) (cheight - dheight)

Definition at line 6046 of file triangle.cpp.

cdheighttail

REAL cdheighttail

Definition at line 6004 of file triangle.cpp.

cdx

cdx = (REAL) (pc[0] - pd[0])

Definition at line 5382 of file triangle.cpp.

cdxady

REAL cdxady = cdx * ady

Definition at line 5901 of file triangle.cpp.

cdxady0

REAL cdxady0

Definition at line 5323 of file triangle.cpp.

cdxady1

INEXACT REAL cdxady1

Definition at line 5322 of file triangle.cpp.

cdxbdy

REAL cdxbdy = cdx * bdy

Definition at line 5901 of file triangle.cpp.

cdxbdy0

REAL cdxbdy0

Definition at line 5323 of file triangle.cpp.

cdxbdy1

INEXACT REAL cdxbdy1

Definition at line 5322 of file triangle.cpp.

cdxcdx0

REAL cdxcdx0

Definition at line 5340 of file triangle.cpp.

cdxcdx1

INEXACT REAL cdxcdx1

Definition at line 5339 of file triangle.cpp.

cdxt_ady0

REAL cdxt_ady0

Definition at line 6012 of file triangle.cpp.

cdxt_ady1

INEXACT REAL cdxt_ady1

Definition at line 6010 of file triangle.cpp.

cdxt_adyt0

REAL cdxt_adyt0

Definition at line 6022 of file triangle.cpp.

cdxt_adyt1

INEXACT REAL cdxt_adyt1

Definition at line 6020 of file triangle.cpp.

cdxt_bdy0

REAL cdxt_bdy0

Definition at line 6012 of file triangle.cpp.

cdxt_bdy1

INEXACT REAL cdxt_bdy1

Definition at line 6010 of file triangle.cpp.

cdxt_bdyt0

REAL cdxt_bdyt0

Definition at line 6022 of file triangle.cpp.

cdxt_bdyt1

INEXACT REAL cdxt_bdyt1

Definition at line 6020 of file triangle.cpp.

cdxtail

REAL cdxtail

Definition at line 5338 of file triangle.cpp.

cdy

cdy = (REAL) (pc[1] - pd[1])

Definition at line 5385 of file triangle.cpp.

cdycdy0

REAL cdycdy0

Definition at line 5340 of file triangle.cpp.

cdycdy1

INEXACT REAL cdycdy1

Definition at line 5339 of file triangle.cpp.

cdyt_adx0

REAL cdyt_adx0

Definition at line 6016 of file triangle.cpp.

cdyt_adx1

INEXACT REAL cdyt_adx1

Definition at line 6014 of file triangle.cpp.

cdyt_bdx0

REAL cdyt_bdx0

Definition at line 6016 of file triangle.cpp.

cdyt_bdx1

INEXACT REAL cdyt_bdx1

Definition at line 6014 of file triangle.cpp.

cdytail

REAL cdytail

Definition at line 5338 of file triangle.cpp.

changemade

int changemade

Definition at line 9448 of file triangle.cpp.

check4events

int check4events

Definition at line 10814 of file triangle.cpp.

checkapex

vertex checkapex

Definition at line 11153 of file triangle.cpp.

checkdest

vertex checkdest

Definition at line 11153 of file triangle.cpp.

checkedge

struct otri checkedge

Initial value:

{
  struct otri backtracktri

Definition at line 7508 of file triangle.cpp.

checkleft

struct otri checkleft

Definition at line 11146 of file triangle.cpp.

checkmark

struct osub checkmark

Initial value:

{
  struct otri triangleloop, trisym

Definition at line 13722 of file triangle.cpp.

checkneighbor

struct otri checkneighbor

Definition at line 11147 of file triangle.cpp.

checkquality

m checkquality = 0

Definition at line 6652 of file triangle.cpp.

checksegments

m checksegments = 0

Definition at line 6651 of file triangle.cpp.

checksubseg

struct osub checksubseg

Definition at line 8226 of file triangle.cpp.

checktri

struct otri checktri

Definition at line 10530 of file triangle.cpp.

checkvertex

vertex checkvertex = (vertex) NULL

Definition at line 9447 of file triangle.cpp.

cheight

REAL cheight

Definition at line 5974 of file triangle.cpp.

circletopcount

m circletopcount

Definition at line 10506 of file triangle.cpp.

circumcenter

REAL circumcenter = torg[1] + dy

Definition at line 6529 of file triangle.cpp.

circumcentercount

m circumcentercount

Definition at line 6541 of file triangle.cpp.

clen

int clen = fast_expansion_sum_zeroelim(cxxablen, cxxab, cyyablen, cyyab, cdet)

Definition at line 5331 of file triangle.cpp.

clift

clift = cdx * cdx + cdy * cdy

Definition at line 5902 of file triangle.cpp.

collinear

enum finddirectionresult collinear = finddirection(m, b, splittri, endpoint1)

Definition at line 11708 of file triangle.cpp.

collision

collision = 0

Definition at line 12167 of file triangle.cpp.

conformdel

b conformdel = 0

Definition at line 3316 of file triangle.cpp.

connectvertex

vertex connectvertex

Definition at line 10810 of file triangle.cpp.

coordindex

int coordindex = 0

Definition at line 14105 of file triangle.cpp.

corner

int corner[3]

Definition at line 11158 of file triangle.cpp.

corners

int corners

Definition at line 11100 of file triangle.cpp.

cossquare

REAL cossquare

Definition at line 15358 of file triangle.cpp.

cossquaretable

REAL cossquaretable[8]

Definition at line 15353 of file triangle.cpp.

counterclockcount

m counterclockcount

Definition at line 5254 of file triangle.cpp.

crosssubseg

struct osub crosssubseg

Initial value:

{
  struct otri crosstri

Definition at line 11829 of file triangle.cpp.

ct_a

REAL ct_a[4]

Definition at line 6008 of file triangle.cpp.

ct_alarge

INEXACT REAL ct_alarge

Definition at line 6007 of file triangle.cpp.

ct_alen

int ct_alen

Definition at line 6009 of file triangle.cpp.

ct_b

REAL ct_b[4]

Definition at line 6008 of file triangle.cpp.

ct_blarge

INEXACT REAL ct_blarge

Definition at line 6007 of file triangle.cpp.

ct_blen

int ct_blen

Definition at line 6009 of file triangle.cpp.

current

current = b->firstnumber

Definition at line 4591 of file triangle.cpp.

currentenc

struct osub currentenc

Definition at line 13249 of file triangle.cpp.

currentmarker

int currentmarker

Definition at line 13909 of file triangle.cpp.

cxab

REAL cxab[8]

Definition at line 5330 of file triangle.cpp.

cxablen

cxablen = scale_expansion_zeroelim(4, ab, cdx, cxab)

Definition at line 5331 of file triangle.cpp.

cxtaa

REAL cxtaa[8]

Definition at line 5355 of file triangle.cpp.

cxtaalen

int cxtaalen

Definition at line 5356 of file triangle.cpp.

cxtab

REAL cxtab[8]

Definition at line 5357 of file triangle.cpp.

cxtablen

int cxtablen

Definition at line 5358 of file triangle.cpp.

cxtabt

REAL cxtabt[16]

Definition at line 5359 of file triangle.cpp.

cxtabtlen

int cxtabtlen

Definition at line 5360 of file triangle.cpp.

cxtabtt

REAL cxtabtt[8]

Definition at line 5362 of file triangle.cpp.

cxtabttlen

int cxtabttlen

Definition at line 5363 of file triangle.cpp.

cxtbb

REAL cxtbb[8]

Definition at line 5355 of file triangle.cpp.

cxtbblen

int cxtbblen

Definition at line 5356 of file triangle.cpp.

cxxab

REAL cxxab[16]

Definition at line 5330 of file triangle.cpp.

cxxablen

cxxablen = scale_expansion_zeroelim(cxablen, cxab, cdx, cxxab)

Definition at line 5331 of file triangle.cpp.

cyab

REAL cyab[8]

Definition at line 5330 of file triangle.cpp.

cyablen

cyablen = scale_expansion_zeroelim(4, ab, cdy, cyab)

Definition at line 5331 of file triangle.cpp.

cytaa

REAL cytaa[8]

Definition at line 5355 of file triangle.cpp.

cytaalen

int cytaalen

Definition at line 5356 of file triangle.cpp.

cytab

REAL cytab[8]

Definition at line 5357 of file triangle.cpp.

cytablen

int cytablen

Definition at line 5358 of file triangle.cpp.

cytabt

REAL cytabt[16]

Definition at line 5359 of file triangle.cpp.

cytabtlen

int cytabtlen

Definition at line 5360 of file triangle.cpp.

cytabtt

REAL cytabtt[8]

Definition at line 5362 of file triangle.cpp.

cytabttlen

int cytabttlen

Definition at line 5363 of file triangle.cpp.

cytbb

REAL cytbb[8]

Definition at line 5355 of file triangle.cpp.

cytbblen

int cytbblen

Definition at line 5356 of file triangle.cpp.

cyyab

REAL cyyab[16]

Definition at line 5330 of file triangle.cpp.

cyyablen

cyyablen = scale_expansion_zeroelim(cyablen, cyab, cdy, cyyab)

Definition at line 5331 of file triangle.cpp.

D

REAL D[16]

Definition at line 5165 of file triangle.cpp.

dadist

dadist

Initial value:

= (tdest[0] - tapex[0]) * (tdest[0] - tapex[0]) +
           (tdest[1] - tapex[1]) * (tdest[1] - tapex[1])

Definition at line 6537 of file triangle.cpp.

dalen

dalen = dxda * dxda + dyda * dyda

Definition at line 1378 of file triangle.cpp.

deadapex

vertex deadapex

Definition at line 12674 of file triangle.cpp.

deaddest

vertex deaddest

Definition at line 12674 of file triangle.cpp.

deaditemstack

m vertices deaditemstack = (VOID *) NULL

Definition at line 13737 of file triangle.cpp.

deadorg

vertex deadorg

Definition at line 12674 of file triangle.cpp.

deadtriangle

triangle ** deadtriangle

Definition at line 9921 of file triangle.cpp.

degconst

degconst = 180.0 / PI

Definition at line 15368 of file triangle.cpp.

deltri

setorg * deltri

Definition at line 8958 of file triangle.cpp.

deltriright

struct otri deltriright

Definition at line 8964 of file triangle.cpp.

delvertex

vertex delvertex

Definition at line 8968 of file triangle.cpp.

denom

denom = ty * ex - tx * ey

Definition at line 11712 of file triangle.cpp.

denominator

REAL denominator

Definition at line 6538 of file triangle.cpp.

dest1

vertex dest1

Definition at line 7226 of file triangle.cpp.

dest2

vertex dest2

Definition at line 7226 of file triangle.cpp.

destlen

destlen = dxao2 + dyao2

Definition at line 7230 of file triangle.cpp.

destorient

REAL destorient

Definition at line 7510 of file triangle.cpp.

det

REAL det = estimate(4, B)

Definition at line 5164 of file triangle.cpp.

detleft

detleft = (pa[0] - pc[0]) * (pb[1] - pc[1])

Definition at line 5162 of file triangle.cpp.

detlefttail

REAL detlefttail

Definition at line 5163 of file triangle.cpp.

detright

detright = (pa[1] - pc[1]) * (pb[0] - pc[0])

Definition at line 5162 of file triangle.cpp.

detrighttail

REAL detrighttail

Definition at line 5163 of file triangle.cpp.

detsum

REAL detsum

Initial value:

{
  REAL detleft, detright, det

Definition at line 5156 of file triangle.cpp.

dheight

REAL dheight

Definition at line 5974 of file triangle.cpp.

dissolveedge

struct otri nextedge finaledge dissolveedge

Initial value:

{
  struct otri searchedge

Definition at line 9920 of file triangle.cpp.

dist

REAL dist

Definition at line 7654 of file triangle.cpp.

dist1

REAL dist1

Definition at line 7233 of file triangle.cpp.

dist2

REAL dist2

Definition at line 7233 of file triangle.cpp.

divider

int divider = arraysize >> 1

Definition at line 9366 of file triangle.cpp.

divisor

REAL divisor

Definition at line 13256 of file triangle.cpp.

Dlength

Dlength = fast_expansion_sum_zeroelim(C2length, C2, 4, u, D)

Definition at line 5167 of file triangle.cpp.

do

do

Initial value:

{
    newtriangle = (triangle *) traverse(&m->triangles)

Definition at line 4410 of file triangle.cpp.

docheck

b docheck = 0

Definition at line 3314 of file triangle.cpp.

dodist

dodist

Initial value:

{
  REAL xdo, ydo, xao, yao

Definition at line 6537 of file triangle.cpp.

doflip

int doflip

Definition at line 8238 of file triangle.cpp.

done

done = 0

Definition at line 12168 of file triangle.cpp.

dotproduct

REAL dotproduct

Definition at line 7113 of file triangle.cpp.

dummy

int dummy

Initial value:

{
  struct osub subsegloop

Definition at line 13185 of file triangle.cpp.

dummytri

*int *m dummytri

Initial value:

= (triangle *)
    (alignptr + (unsigned long) m->triangles.alignbytes -
     (alignptr % (unsigned long) m->triangles.alignbytes))

Definition at line 4166 of file triangle.cpp.

dummytribase

m dummytribase

Initial value:

= (triangle *) trimalloc(trianglebytes +
                                           m->triangles.alignbytes)

Definition at line 4204 of file triangle.cpp.

dwyer

b dwyer = 1

Definition at line 3312 of file triangle.cpp.

dx

REAL dx = (yao * dodist - ydo * aodist) * denominator

Definition at line 6539 of file triangle.cpp.

dxa

REAL dxa

Initial value:

{
  vertex leftvertex, rightvertex

Definition at line 10463 of file triangle.cpp.

dxao

dxao = tapex[0] - torg[0]

Definition at line 7228 of file triangle.cpp.

dxao2

dxao2 = dxao * dxao

Definition at line 7229 of file triangle.cpp.

dxb

dxb = rightvertex[0] - newsite[0]

Definition at line 10463 of file triangle.cpp.

dxda

REAL dxda = tridest[0] - triapex[0]

Definition at line 1383 of file triangle.cpp.

dxda2

dxda2 = dxda * dxda

Definition at line 7229 of file triangle.cpp.

dxoa

dxoa = triorg[0] - triapex[0]

Definition at line 1381 of file triangle.cpp.

dxod

REAL dxod = triorg[0] - tridest[0]

Definition at line 1385 of file triangle.cpp.

dxod2

dxod2 = dxod * dxod

Definition at line 7229 of file triangle.cpp.

dxoff

REAL dxoff

Definition at line 6539 of file triangle.cpp.

dy

REAL dy = (xdo * aodist - xao * dodist) * denominator

Definition at line 6539 of file triangle.cpp.

dya

return dya *dxb *dxb dyb *dyb dyb *dxa *dxa dya * dya = leftvertex[1] - newsite[1]

Definition at line 10463 of file triangle.cpp.

dyao

dyao = tapex[1] - torg[1]

Definition at line 7228 of file triangle.cpp.

dyao2

dyao2 = dyao * dyao

Definition at line 7229 of file triangle.cpp.

dyb

dyb = rightvertex[1] - newsite[1]

Definition at line 10463 of file triangle.cpp.

dyda

REAL dyda = tridest[1] - triapex[1]

Definition at line 1377 of file triangle.cpp.

dyda2

dyda2 = dyda * dyda

Definition at line 7229 of file triangle.cpp.

dyingseg

struct badsubseg* dyingseg

Definition at line 4525 of file triangle.cpp.

dyingsubseg

subseg* dyingsubseg

Definition at line 4430 of file triangle.cpp.

dyingtriangle

triangle* dyingtriangle

Definition at line 4384 of file triangle.cpp.

dyingvertex

vertex dyingvertex

Definition at line 4476 of file triangle.cpp.

dyoa

dyoa

Initial value:

{
  REAL dxoa, dxda, dxod

Definition at line 1377 of file triangle.cpp.

dyod

REAL dyod = triorg[1] - tridest[1]

Definition at line 1377 of file triangle.cpp.

dyod2

dyod2 = dyod * dyod

Definition at line 7229 of file triangle.cpp.

dyoff

REAL dyoff

Definition at line 6539 of file triangle.cpp.

e

REAL * e

Definition at line 4963 of file triangle.cpp.

eapex

vertex eapex

Definition at line 7116 of file triangle.cpp.

edest

vertex edest

Definition at line 7116 of file triangle.cpp.

edgecount

int edgecount = 1

Definition at line 8858 of file triangle.cpp.

edgefilename

char * edgefilename

Definition at line 14799 of file triangle.cpp.

edgelength

REAL edgelength[3]

Definition at line 15356 of file triangle.cpp.

edgelist

int ** edgelist

Definition at line 14786 of file triangle.cpp.

edgemarkerlist

int** edgemarkerlist

Definition at line 14790 of file triangle.cpp.

edgenumber

edgenumber = b->firstnumber

Definition at line 14820 of file triangle.cpp.

edges

m edges = (3l * m.triangles.items + m.hullsize) / 2l

Definition at line 15849 of file triangle.cpp.

edgesout

b edgesout = b->voronoi = b->neighbors = b->geomview = 0

Definition at line 3307 of file triangle.cpp.

eextras

m eextras = 0

Definition at line 11027 of file triangle.cpp.

eindex

int eindex = findex = 0

Definition at line 4977 of file triangle.cpp.

elefile

elefile = fopen(elefilename, "r")

Definition at line 11137 of file triangle.cpp.

elefilename

char * elefilename

Definition at line 11121 of file triangle.cpp.

elemattribindex

m elemattribindex = (trisize + sizeof(REAL) - 1) / sizeof(REAL)

Definition at line 4333 of file triangle.cpp.

elementnumber

long elementnumber = b->firstnumber

Definition at line 11167 of file triangle.cpp.

elements

int elements

Definition at line 11100 of file triangle.cpp.

elen

REAL e int elen

Definition at line 4964 of file triangle.cpp.

elist

int * elist = *edgelist

Definition at line 14836 of file triangle.cpp.

else

else

Initial value:

{
    return 0

Definition at line 1397 of file triangle.cpp.

emlist

emlist

Initial value:

{
#ifdef TRILIBRARY
  int *elist

Definition at line 14812 of file triangle.cpp.

encloop

struct badsubseg* encloop

Definition at line 13250 of file triangle.cpp.

encodedtri

encodedtri

Initial value:

{
  struct otri searchtri1, searchtri2

Definition at line 12265 of file triangle.cpp.

encroached

struct badsubseg * encroached = 0

Definition at line 7114 of file triangle.cpp.

encroachedseg

struct badsubseg* encroachedseg

Definition at line 7112 of file triangle.cpp.

end

int end[2]

Definition at line 11159 of file triangle.cpp.

end1

int end1

Definition at line 12446 of file triangle.cpp.

end2

int end2

Definition at line 12446 of file triangle.cpp.

endpoint1

vertex endpoint1

Initial value:

{
  struct osub opposubseg

Definition at line 11703 of file triangle.cpp.

endpoint2

vertex endpoint2

Definition at line 11698 of file triangle.cpp.

enow

REAL enow = e[0]

Definition at line 4978 of file triangle.cpp.

enq

int enq

Definition at line 8240 of file triangle.cpp.

enqapex

vertex enqapex

Definition at line 7013 of file triangle.cpp.

enqdest

vertex enqdest

Definition at line 7020 of file triangle.cpp.

enqorg

vertex enqorg

Definition at line 7013 of file triangle.cpp.

enqtri

struct otri * enqtri

Definition at line 7013 of file triangle.cpp.

eorg

vertex eorg

Definition at line 7116 of file triangle.cpp.

epsilon

REAL epsilon

Definition at line 647 of file triangle.cpp.

err1

REAL err1

Definition at line 5076 of file triangle.cpp.

err2

REAL err2

Definition at line 5076 of file triangle.cpp.

err3

REAL err3

Definition at line 5076 of file triangle.cpp.

errbound

REAL errbound = ccwerrboundB * detsum

Definition at line 5164 of file triangle.cpp.

errorflag

int errorflag

Definition at line 13500 of file triangle.cpp.

eta

REAL eta = (xdo * dy - ydo * dx) * (2.0 * denominator)

Definition at line 6531 of file triangle.cpp.

etx

etx = torg[0] - endpoint2[0]

Definition at line 11711 of file triangle.cpp.

ety

ety = torg[1] - endpoint2[1]

Definition at line 11711 of file triangle.cpp.

eventheap

eventheap

Initial value:

= (struct event **) trimalloc(maxevents *
                                           (int) sizeof(struct event *))

Definition at line 10417 of file triangle.cpp.

eventnum

int eventnum

Initial value:

{
  REAL eventx, eventy

Definition at line 10284 of file triangle.cpp.

eventptr

eventheap [0] eventptr = (VOID *) freeevents

Definition at line 10840 of file triangle.cpp.

events

struct event * events = (struct event *) trimalloc(maxevents * (int) sizeof(struct event))

Definition at line 10417 of file triangle.cpp.

eventvertex

vertex eventvertex

Initial value:

{
  struct event *deadevent

Definition at line 10538 of file triangle.cpp.

eventx

REAL eventx = newevent->xkey

Definition at line 10288 of file triangle.cpp.

eventy

REAL eventy = newevent->ykey

Definition at line 10289 of file triangle.cpp.

ex

ex = endpoint2[0] - endpoint1[0]

Definition at line 11709 of file triangle.cpp.

expincrement

int expincrement

Definition at line 6915 of file triangle.cpp.

exponent

exponent

Initial value:

{
  REAL length, multiplier

Definition at line 6915 of file triangle.cpp.

ey

ey = endpoint2[1] - endpoint1[1]

Definition at line 11709 of file triangle.cpp.

f

REAL* f

Definition at line 4963 of file triangle.cpp.

fapex

vertex fapex

Definition at line 7509 of file triangle.cpp.

faredge

struct osub faredge

Definition at line 12043 of file triangle.cpp.

farleft

struct otri * farleft

Definition at line 9423 of file triangle.cpp.

farleftapex

vertex farleftapex

Definition at line 9443 of file triangle.cpp.

farleftpt

vertex farleftpt

Definition at line 9442 of file triangle.cpp.

farright

* farright = farrightflag

Definition at line 9423 of file triangle.cpp.

farrightapex

vertex farrightapex

Definition at line 9443 of file triangle.cpp.

farrightflag

int farrightflag = 0

Definition at line 10775 of file triangle.cpp.

farrightpt

vertex farrightpt

Definition at line 9442 of file triangle.cpp.

farrighttri

struct otri lefttri righttri farlefttri farrighttri

Definition at line 10806 of file triangle.cpp.

fartri

struct otri fartri

Initial value:

{
  struct otri neartri

Definition at line 12042 of file triangle.cpp.

farvertex

vertex farvertex

Definition at line 7930 of file triangle.cpp.

fdest

vertex fdest

Definition at line 7509 of file triangle.cpp.

fin1

REAL fin1

Definition at line 5334 of file triangle.cpp.

fin2

REAL fin2

Definition at line 5334 of file triangle.cpp.

findex

int findex

Definition at line 4977 of file triangle.cpp.

finlength

int finlength = fast_expansion_sum_zeroelim(ablen, abdet, clen, cdet, fin1)

Definition at line 5336 of file triangle.cpp.

finnow

return finnow = fin1

Definition at line 5335 of file triangle.cpp.

finother

REAL * finother = fin2

Definition at line 5335 of file triangle.cpp.

finswap

REAL * finswap = finnow

Definition at line 5335 of file triangle.cpp.

first

vertex first

Definition at line 8231 of file triangle.cpp.

firstedge

onext * firstedge

Definition at line 8858 of file triangle.cpp.

firstnode

int firstnode

Definition at line 13907 of file triangle.cpp.

firstnumber

b firstnumber = 1

Definition at line 3306 of file triangle.cpp.

firsttri

char* firsttri

Initial value:

{
  VOID **sampleblock

Definition at line 7650 of file triangle.cpp.

firstvertex

firstvertex = (vertex) eventheap[0]->eventptr

Definition at line 10808 of file triangle.cpp.

fixuptri

lprevself * fixuptri

Definition at line 12033 of file triangle.cpp.

flen

int flen

Definition at line 4963 of file triangle.cpp.

flipedge

setapex * flipedge

Definition at line 7918 of file triangle.cpp.

fliptri

struct otri fliptri

Definition at line 10805 of file triangle.cpp.

fnow

fnow = f[0]

Definition at line 4978 of file triangle.cpp.

forg

vertex forg

Definition at line 7509 of file triangle.cpp.

foundvertex

foundvertex

Initial value:

{
  VOID **getblock

Definition at line 4589 of file triangle.cpp.

freeevents

struct event * freeevents = (struct event *) NULL

Definition at line 10421 of file triangle.cpp.

fronttri

apex * fronttri

Definition at line 10455 of file triangle.cpp.

getblock

getblock = m->vertices.firstblock

Definition at line 4593 of file triangle.cpp.

gluetri

struct otri gluetri

Definition at line 9067 of file triangle.cpp.

goodangle

b goodangle = cos(b->minangle * PI / 180.0)

Definition at line 3523 of file triangle.cpp.

h

REAL * h

Definition at line 4968 of file triangle.cpp.

hdest

vertex hdest

Definition at line 12590 of file triangle.cpp.

heap

void eventnum struct event ** heap = newevent

Definition at line 10277 of file triangle.cpp.

heapposition

moveevent heapposition = eventnum

Definition at line 10307 of file triangle.cpp.

heapsize

int heapsize = m->invertices

Definition at line 10276 of file triangle.cpp.

hh

REAL hh

Initial value:

{
  INEXACT REAL Q, sum

Definition at line 4974 of file triangle.cpp.

highorderindex

m highorderindex = 6 + (b->usesegments * 3)

Definition at line 4327 of file triangle.cpp.

hindex

return hindex = 0

Definition at line 4977 of file triangle.cpp.

hlist

* hlist = holelist

Definition at line 14175 of file triangle.cpp.

holearray

REAL* holearray

Definition at line 15695 of file triangle.cpp.

holelist

REAL * holelist

Definition at line 12985 of file triangle.cpp.

holenumber

long holenumber

Definition at line 14676 of file triangle.cpp.

holes

int holes = (int) strtol(stringptr, &stringptr, 0)

Definition at line 12985 of file triangle.cpp.

holetri

triangle** holetri

Definition at line 12998 of file triangle.cpp.

horg

vertex horg

Definition at line 12590 of file triangle.cpp.

horrors

int horrors = 0

Definition at line 6707 of file triangle.cpp.

hulledges

hulledges = divconqdelaunay(m, b)

Definition at line 11035 of file triangle.cpp.

hullright

struct otri hullleft hullright

Initial value:

{
  vertex *sortarray

Definition at line 9982 of file triangle.cpp.

hullsize

m hullsize = 0

Definition at line 9923 of file triangle.cpp.

hullsubseg

struct osub hullsubseg

Definition at line 12588 of file triangle.cpp.

hyperbolacount

m hyperbolacount = m->circletopcount = m->circumcentercount = 0

Definition at line 6654 of file triangle.cpp.

i

int i = 0

Definition at line 3300 of file triangle.cpp.

iccerrboundA

REAL iccerrboundA

Definition at line 650 of file triangle.cpp.

iccerrboundB

REAL iccerrboundB

Definition at line 650 of file triangle.cpp.

iccerrboundC

REAL iccerrboundC

Definition at line 650 of file triangle.cpp.

ii

int ii

Definition at line 15374 of file triangle.cpp.

in

struct triangulateio * in

Definition at line 15673 of file triangle.cpp.

incirclecount

m incirclecount = m->counterclockcount = m->orient3dcount = 0

Definition at line 5906 of file triangle.cpp.

incorners

incorners = corners

Definition at line 11161 of file triangle.cpp.

increment

increment = 0

Definition at line 3565 of file triangle.cpp.

incremental

b incremental = b->sweepline = 0

Definition at line 3311 of file triangle.cpp.

index

int index

Initial value:

{
#ifdef TRILIBRARY
  char polyfilename[6]

Definition at line 12439 of file triangle.cpp.

inelements

m inelements = elements

Definition at line 11172 of file triangle.cpp.

infile

FILE * infile

Definition at line 13806 of file triangle.cpp.

infilename

char * infilename = nodefilename

Definition at line 13809 of file triangle.cpp.

infvertex1

m infvertex1 = (vertex) trimalloc(m->vertices.itembytes)

Definition at line 10083 of file triangle.cpp.

infvertex2

m infvertex2 = (vertex) trimalloc(m->vertices.itembytes)

Definition at line 10084 of file triangle.cpp.

infvertex3

m infvertex3 = (vertex) trimalloc(m->vertices.itembytes)

Definition at line 10085 of file triangle.cpp.

innerleft

sym * innerleft

Definition at line 9423 of file triangle.cpp.

innerleftapex

vertex innerleftapex

Definition at line 9441 of file triangle.cpp.

innerleftdest

vertex innerleftdest

Definition at line 9439 of file triangle.cpp.

innerright

struct otri innerleft innerright

Initial value:

{
  struct otri midtri, tri1, tri2, tri3

Definition at line 9423 of file triangle.cpp.

innerrightapex

vertex innerrightapex

Definition at line 9441 of file triangle.cpp.

innerrightorg

vertex innerrightorg

Definition at line 9440 of file triangle.cpp.

innodefilename

b innodefilename[0] = '\0'

Definition at line 3323 of file triangle.cpp.

inputline

char inputline

Definition at line 11139 of file triangle.cpp.

inserttri

struct otri inserttri

Definition at line 10807 of file triangle.cpp.

intersect

enum locateresult intersect = ONEDGE

Definition at line 8237 of file triangle.cpp.

invertices

m invertices = numberofpoints

Definition at line 14108 of file triangle.cpp.

j

int j = 1

Definition at line 3300 of file triangle.cpp.

joinvertex

vertex joinvertex

Definition at line 7227 of file triangle.cpp.

k

int k

Definition at line 3300 of file triangle.cpp.

key

newbad key = minedge

Definition at line 7029 of file triangle.cpp.

killorg

int killorg

Definition at line 12675 of file triangle.cpp.

killvertex

vertex killvertex

Definition at line 11155 of file triangle.cpp.

killvertexindex

int killvertexindex

Definition at line 11160 of file triangle.cpp.

lastedge

struct otri firstedge lastedge

Initial value:

{
  struct otri countingtri

Definition at line 8858 of file triangle.cpp.

lastvertex

lastvertex = secondvertex

Definition at line 10809 of file triangle.cpp.

lchild

splayroot lchild = (struct splaynode *) NULL

Definition at line 10703 of file triangle.cpp.

left

left = -1

Definition at line 9232 of file triangle.cpp.

leftbasevertex

vertex leftbasevertex

Definition at line 8872 of file triangle.cpp.

leftccw

leftccw = counterclockwise(m, b, searchpoint, startvertex, leftvertex)

Definition at line 11609 of file triangle.cpp.

leftchild

leftchild = 2 * eventnum + 1

Definition at line 10326 of file triangle.cpp.

leftfinished

int leftfinished

Definition at line 9450 of file triangle.cpp.

leftflag

leftflag = leftccw > 0.0

Definition at line 11610 of file triangle.cpp.

leftright

struct splaynode* leftright

Definition at line 10571 of file triangle.cpp.

leftside

int leftside

Definition at line 12037 of file triangle.cpp.

lefttest

REAL lefttest

Definition at line 10812 of file triangle.cpp.

lefttree

return lefttree

Initial value:

{
  struct splaynode *child, *grandchild

Definition at line 10570 of file triangle.cpp.

leftvertex

vertex leftvertex

Definition at line 7929 of file triangle.cpp.

longest

longest = 0.0

Definition at line 15360 of file triangle.cpp.

lowerleft

lowerleft = innerleftdest

Definition at line 9444 of file triangle.cpp.

lowerright

lowerright = innerrightorg

Definition at line 9444 of file triangle.cpp.

m

triangledeinit & m

Initial value:

{
  poolzero(&m->vertices)

Definition at line 3669 of file triangle.cpp.

markorg

vertex markorg

Definition at line 9922 of file triangle.cpp.

maxarea

b maxarea = -1.0

Definition at line 3320 of file triangle.cpp.

maxevents

maxevents

Initial value:

{
  vertex thisvertex

Definition at line 10426 of file triangle.cpp.

maxlen

maxlen = (dalen > oalen) ? dalen : oalen

Definition at line 1379 of file triangle.cpp.

median

int median

Definition at line 9279 of file triangle.cpp.

memptr

memptr = (VOID *) malloc((unsigned int) size)

Definition at line 1433 of file triangle.cpp.

mesh_dim

m mesh_dim = 2

Definition at line 14109 of file triangle.cpp.

meshnumber

meshnumber

Initial value:

{
#ifdef TRILIBRARY
#define STARTINDEX 0
#else 
#define STARTINDEX 1
  int increment

Definition at line 3298 of file triangle.cpp.

mid1

vertex mid1

Definition at line 14533 of file triangle.cpp.

mid2

vertex mid2

Definition at line 14533 of file triangle.cpp.

mid3

vertex mid3

Definition at line 14533 of file triangle.cpp.

midvertex

vertex midvertex

Definition at line 10811 of file triangle.cpp.

midvertex1

vertex midvertex1

Definition at line 11915 of file triangle.cpp.

midvertex2

vertex midvertex2

Definition at line 11915 of file triangle.cpp.

minaltitude

minaltitude = m->xmax - m->xmin + m->ymax - m->ymin

Definition at line 15364 of file triangle.cpp.

minangle

b minangle = 0.0

Definition at line 3319 of file triangle.cpp.

minedge

REAL minedge

Definition at line 7013 of file triangle.cpp.

minus1mod3

int minus1mod3[3] = {2, 0, 1}

Definition at line 933 of file triangle.cpp.

mirrorflag

int mirrorflag

Definition at line 8239 of file triangle.cpp.

moveevent

moveevent = heap[heapsize - 1]

Definition at line 10385 of file triangle.cpp.

moveleft

int moveleft

Definition at line 7511 of file triangle.cpp.

multiplier

REAL multiplier

Definition at line 13256 of file triangle.cpp.

ndest

vertex ndest

Definition at line 12673 of file triangle.cpp.

nearestpoweroftwo

REAL nearestpoweroftwo

Definition at line 13254 of file triangle.cpp.

nearvertex

vertex nearvertex

Definition at line 12044 of file triangle.cpp.

negate

REAL negate

Definition at line 5369 of file triangle.cpp.

neighbor

struct otri neighbor

Initial value:

{
  struct otri testtri

Definition at line 12668 of file triangle.cpp.

neighbor1

int neighbor1

Definition at line 15183 of file triangle.cpp.

neighbor2

int neighbor2

Definition at line 15183 of file triangle.cpp.

neighbor3

int neighbor3

Definition at line 15183 of file triangle.cpp.

neighborfilename

char * neighborfilename

Definition at line 15164 of file triangle.cpp.

neighborlist

int** neighborlist

Definition at line 15155 of file triangle.cpp.

neighborsubseg

struct osub neighborsubseg

Definition at line 12671 of file triangle.cpp.

newbad

newbad = (struct badtriang *) poolalloc(&m->badtriangles)

Definition at line 7027 of file triangle.cpp.

newbotright

struct otri newbotleft newbotright

Definition at line 8218 of file triangle.cpp.

newevent

struct event * newevent

Definition at line 10279 of file triangle.cpp.

newflip

struct flipstacker* newflip

Definition at line 8230 of file triangle.cpp.

newkey

struct otri * newkey

Definition at line 10680 of file triangle.cpp.

newmark

int newmark

Definition at line 11824 of file triangle.cpp.

neworg

vertex neworg

Definition at line 8969 of file triangle.cpp.

newotri

struct otri* newotri

Definition at line 4666 of file triangle.cpp.

newseg

return newseg

Definition at line 4561 of file triangle.cpp.

newsite

vertex newsite

Definition at line 10458 of file triangle.cpp.

newsplaynode

return newsplaynode = (struct splaynode *) poolalloc(&m->splaynodes)

Definition at line 10690 of file triangle.cpp.

newsubseg

struct osub newsubseg

Initial value:

{
  struct otri oppotri

Definition at line 4462 of file triangle.cpp.

newtopright

struct otri newtopright

Definition at line 8219 of file triangle.cpp.

newtriangle

return newtriangle

Definition at line 4416 of file triangle.cpp.

newvertex

vertex newvertex = (vertex) poolalloc(&m->vertices)

Definition at line 4508 of file triangle.cpp.

nextapex

vertex nextapex

Definition at line 9446 of file triangle.cpp.

nextedge

struct otri nextedge

Definition at line 9436 of file triangle.cpp.

nextevent

struct event* nextevent

Definition at line 10800 of file triangle.cpp.

nextras

m nextras = numberofpointattribs

Definition at line 14110 of file triangle.cpp.

nexttri

struct otri nexttri

Initial value:

{
  struct otri hulltri

Definition at line 11151 of file triangle.cpp.

nexttriang

badtri nexttriang = (struct badtriang *) NULL

Definition at line 6993 of file triangle.cpp.

nextvertex

vertex nextvertex

Definition at line 10809 of file triangle.cpp.

nlist

nlist = *neighborlist

Definition at line 15195 of file triangle.cpp.

nobisect

b nobisect = 0

Definition at line 3315 of file triangle.cpp.

nobound

b nobound = b->nopolywritten = b->nonodewritten = b->noelewritten = 0

Definition at line 3308 of file triangle.cpp.

nodefilename

char * nodefilename

Definition at line 13892 of file triangle.cpp.

nodemarkers

int nodemarkers

Definition at line 13908 of file triangle.cpp.

noexact

b noexact = 0

Definition at line 6713 of file triangle.cpp.

noholes

b noholes = b->noexact = 0

Definition at line 3310 of file triangle.cpp.

noiterationnum

b noiterationnum = 0

Definition at line 3309 of file triangle.cpp.

norg

vertex norg

Definition at line 12673 of file triangle.cpp.

normlist

normlist = *vnormlist

Definition at line 14975 of file triangle.cpp.

notdone

int notdone = eventnum > 0

Definition at line 10286 of file triangle.cpp.

notfound

int notfound

Definition at line 11166 of file triangle.cpp.

number

int number

Definition at line 4584 of file triangle.cpp.

numberofcorners

out numberofcorners = (b.order + 1) * (b.order + 2) / 2

Definition at line 15866 of file triangle.cpp.

numberofedges

out numberofedges = m.edges

Definition at line 15868 of file triangle.cpp.

numberofpointattribs

int numberofpointattribs

Definition at line 14098 of file triangle.cpp.

numberofpointattributes

out numberofpointattributes = m.nextras

Definition at line 15864 of file triangle.cpp.

numberofpoints

int numberofpoints

Definition at line 14091 of file triangle.cpp.

numberofsegments

int numberofsegments

Definition at line 11112 of file triangle.cpp.

numberoftriangleattributes

out numberoftriangleattributes = m.eextras

Definition at line 15867 of file triangle.cpp.

numberoftriangles

out numberoftriangles = m.triangles.items

Definition at line 15865 of file triangle.cpp.

o3derrboundA

REAL o3derrboundA

Definition at line 651 of file triangle.cpp.

o3derrboundB

REAL o3derrboundB

Definition at line 651 of file triangle.cpp.

o3derrboundC

REAL o3derrboundC

Definition at line 651 of file triangle.cpp.

oalen

oalen = dxoa * dxoa + dyoa * dyoa

Definition at line 1378 of file triangle.cpp.

odlen

odlen = dxod * dxod + dyod * dyod

Definition at line 1378 of file triangle.cpp.

offcenter

int offcenter

Definition at line 6532 of file triangle.cpp.

offfilename

char * offfilename

Definition at line 15268 of file triangle.cpp.

oppoapex

vertex oppoapex

Definition at line 6806 of file triangle.cpp.

oppodest

vertex oppodest

Definition at line 6706 of file triangle.cpp.

oppooppotri

struct otri oppotri oppooppotri

Initial value:

{
  struct otri triangleloop

Definition at line 6704 of file triangle.cpp.

oppoorg

vertex oppoorg

Definition at line 6706 of file triangle.cpp.

opposubseg

struct osub opposubseg

Definition at line 6804 of file triangle.cpp.

oppotri

struct otri oppotri

Initial value:

{
  struct otri triangleloop

Definition at line 6803 of file triangle.cpp.

order

b order = 1

Definition at line 3318 of file triangle.cpp.

org1

vertex org1

Definition at line 7226 of file triangle.cpp.

org2

vertex org2

Definition at line 7226 of file triangle.cpp.

orglen

orglen = dxda2 + dyda2

Definition at line 7230 of file triangle.cpp.

orgorient

REAL orgorient

Definition at line 7510 of file triangle.cpp.

orient

triangleloop orient = 0

Definition at line 4695 of file triangle.cpp.

orient3dcount

m orient3dcount

Definition at line 6417 of file triangle.cpp.

out

struct triangulateio * out

Definition at line 15673 of file triangle.cpp.

outercasing

struct otri sidecasing topcasing outercasing

Definition at line 9437 of file triangle.cpp.

outfile

FILE * outfile = fopen(nodefilename, "w")

Definition at line 14293 of file triangle.cpp.

outvertices

long outvertices

Definition at line 14362 of file triangle.cpp.

p

vertex p[3]

Initial value:

{
  struct otri triangleloop

Definition at line 15352 of file triangle.cpp.

p1

vertex p1

Definition at line 14532 of file triangle.cpp.

p2

vertex p2

Definition at line 14532 of file triangle.cpp.

p3

vertex p3

Definition at line 14532 of file triangle.cpp.

pa

vertex pa

Definition at line 5153 of file triangle.cpp.

palist

REAL * palist

Initial value:

{
#ifdef TRILIBRARY
  REAL *plist

Definition at line 14354 of file triangle.cpp.

parent

int parent

Definition at line 10285 of file triangle.cpp.

pb

vertex pb

Definition at line 5152 of file triangle.cpp.

pc

vertex pc

Definition at line 5152 of file triangle.cpp.

pd

vertex pd

Definition at line 5310 of file triangle.cpp.

permanent

REAL permanent

Initial value:

= (Absolute(bdxcdy) + Absolute(cdxbdy)) * alift
            + (Absolute(cdxady) + Absolute(adxcdy)) * blift
            + (Absolute(adxbdy) + Absolute(bdxady)) * clift

Definition at line 5315 of file triangle.cpp.

pivot

int pivot

Initial value:

{
  int left, right

Definition at line 9212 of file triangle.cpp.

pivot1

pivot1 = sortarray[pivot][axis]

Definition at line 9289 of file triangle.cpp.

pivot2

pivot2 = sortarray[pivot][1 - axis]

Definition at line 9289 of file triangle.cpp.

pivotx

pivotx = sortarray[pivot][0]

Definition at line 9213 of file triangle.cpp.

pivoty

pivoty = sortarray[pivot][1]

Definition at line 9213 of file triangle.cpp.

plist

plist = *pointlist

Definition at line 14389 of file triangle.cpp.

plus1mod3

int plus1mod3[3] = {1, 2, 0}

Definition at line 932 of file triangle.cpp.

pmlist

pmlist = *pointmarkerlist

Definition at line 14355 of file triangle.cpp.

pointattriblist

REAL ** pointattriblist

Definition at line 14090 of file triangle.cpp.

pointlist

REAL ** pointlist

Definition at line 14090 of file triangle.cpp.

pointmarkerlist

int ** pointmarkerlist

Definition at line 14090 of file triangle.cpp.

poly

b poly = b->refine = b->quality = 0

Definition at line 3303 of file triangle.cpp.

polyfile

FILE * polyfile = (FILE *) NULL

Definition at line 11127 of file triangle.cpp.

polyfilename

char * polyfilename

Definition at line 11121 of file triangle.cpp.

poortri

newbad poortri = encode(*enqtri)

Definition at line 7028 of file triangle.cpp.

population

population = m->triangles.itemsfirstblock

Definition at line 7657 of file triangle.cpp.

posexponent

posexponent = 0

Definition at line 6917 of file triangle.cpp.

prevlink

triangle* prevlink

Definition at line 11150 of file triangle.cpp.

printsh

struct osub printsh

Initial value:

{
  struct otri printtri

Definition at line 3676 of file triangle.cpp.

printvertex

vertex printvertex

Definition at line 3677 of file triangle.cpp.

product0

REAL product0

Definition at line 5068 of file triangle.cpp.

product1

INEXACT REAL product1

Definition at line 5067 of file triangle.cpp.

ptr

triangle ptr

Initial value:

{
  int farrightflag

Definition at line 6709 of file triangle.cpp.

Q

return Q = e[0]

Definition at line 5122 of file triangle.cpp.

Qnew

INEXACT REAL Qnew

Initial value:

{
  REAL Q

Definition at line 4973 of file triangle.cpp.

queuefront

m queuefront[m->firstnonemptyq] = result->nexttriang

Definition at line 7063 of file triangle.cpp.

queuenumber

int queuenumber

Definition at line 6916 of file triangle.cpp.

queuetail

m queuetail[queuenumber] = badtri

Definition at line 6991 of file triangle.cpp.

quiet

b quiet = b->verbose = 0

Definition at line 3321 of file triangle.cpp.

radconst

radconst = PI / 18.0

Definition at line 15368 of file triangle.cpp.

randomseed

randomseed = 1

Definition at line 655 of file triangle.cpp.

ratiotable

ratiotable[15] = 1.5

Definition at line 15354 of file triangle.cpp.

rchild

newsplaynode rchild = righttree

Definition at line 10666 of file triangle.cpp.

readnodefile

m readnodefile = 0

Definition at line 14111 of file triangle.cpp.

regionapex

vertex regionapex

Definition at line 12885 of file triangle.cpp.

regionarray

REAL* regionarray

Definition at line 15696 of file triangle.cpp.

regionattrib

b regionattrib = b->convex = b->weighted = b->jettison = 0

Definition at line 3305 of file triangle.cpp.

regiondest

vertex regiondest

Definition at line 12885 of file triangle.cpp.

regionlist

REAL * regionlist

Initial value:

{
  REAL *holelist

Definition at line 12985 of file triangle.cpp.

regionnumber

long regionnumber

Definition at line 14676 of file triangle.cpp.

regionorg

vertex regionorg

Definition at line 12885 of file triangle.cpp.

regions

m regions = 0

Definition at line 12991 of file triangle.cpp.

regiontri

triangle ** regiontri

Definition at line 12883 of file triangle.cpp.

regiontris

struct otri* regiontris

Definition at line 12997 of file triangle.cpp.

result

return result = m->queuefront[m->firstnonemptyq]

Definition at line 7061 of file triangle.cpp.

resulterrbound

REAL resulterrbound

Definition at line 648 of file triangle.cpp.

return

return

Definition at line 16005 of file triangle.cpp.

right

right = arraysize

Definition at line 9233 of file triangle.cpp.

rightbasevertex

vertex rightbasevertex

Definition at line 8872 of file triangle.cpp.

rightcasing

struct otri leftcasing rightcasing

Definition at line 8966 of file triangle.cpp.

rightccw

rightccw = counterclockwise(m, b, startvertex, searchpoint, rightvertex)

Definition at line 11609 of file triangle.cpp.

rightchild

int rightchild

Definition at line 10326 of file triangle.cpp.

rightfinished

int rightfinished

Definition at line 9450 of file triangle.cpp.

rightflag

rightflag = rightccw > 0.0

Definition at line 11610 of file triangle.cpp.

rightofchild

int rightofchild

Definition at line 10573 of file triangle.cpp.

rightofroot

int rightofroot

Definition at line 10573 of file triangle.cpp.

rightsubseg

struct osub leftsubseg rightsubseg

Definition at line 8227 of file triangle.cpp.

righttest

REAL righttest

Definition at line 10812 of file triangle.cpp.

righttree

righttree = splay(m, splaytree->rchild, searchpoint, searchtri)

Definition at line 10570 of file triangle.cpp.

righttri

struct otri lefttri righttri

Definition at line 8965 of file triangle.cpp.

rightvertex

vertex rightvertex = first

Definition at line 7929 of file triangle.cpp.

rlist

* rlist = (REAL *) NULL

Definition at line 14175 of file triangle.cpp.

s0

REAL s0

Definition at line 5171 of file triangle.cpp.

s1

INEXACT REAL s1

Definition at line 5170 of file triangle.cpp.

sampleblock

sampleblock = m->triangles.firstblock

Definition at line 7717 of file triangle.cpp.

samples

m samples = 1

Definition at line 6650 of file triangle.cpp.

samplesleft

samplesleft

Initial value:

= (m->samples * m->triangles.itemsfirstblock - 1) /
                m->triangles.maxitems + 1

Definition at line 7656 of file triangle.cpp.

samplesperblock

samplesperblock = (m->samples * TRIPERBLOCK - 1) / m->triangles.maxitems + 1

Definition at line 7656 of file triangle.cpp.

sampletri

struct otri sampletri

Definition at line 7651 of file triangle.cpp.

saveexact

int saveexact = b->noexact

Definition at line 6708 of file triangle.cpp.

searchdest

vertex searchdest

Definition at line 13000 of file triangle.cpp.

searchdist

searchdist

Initial value:

= (searchpoint[0] - torg[0]) * (searchpoint[0] - torg[0]) +
               (searchpoint[1] - torg[1]) * (searchpoint[1] - torg[1])

Definition at line 7654 of file triangle.cpp.

searchedge

struct otri searchedge

Initial value:

{
  struct otri deadtriangle

Definition at line 10135 of file triangle.cpp.

searchorg

vertex searchorg

Definition at line 13000 of file triangle.cpp.

searchpoint

vertex searchpoint = pc[0] - (yac * bclen2 - ybc * aclen2) / (2.0 * ccwabc)

Definition at line 7498 of file triangle.cpp.

searchtri

apex * searchtri

Definition at line 7498 of file triangle.cpp.

searchvertex

vertex searchvertex

Definition at line 10758 of file triangle.cpp.

secondvertex

vertex secondvertex

Definition at line 10808 of file triangle.cpp.

segmentdest

vertex segmentdest

Definition at line 8233 of file triangle.cpp.

segmentflaws

int segmentflaws

Definition at line 8203 of file triangle.cpp.

segmentlength

REAL segmentlength

Definition at line 13254 of file triangle.cpp.

segmentlist

int ** segmentlist

Definition at line 11100 of file triangle.cpp.

segmentmarkerlist

int ** segmentmarkerlist

Definition at line 11100 of file triangle.cpp.

segmentmarkers

int segmentmarkers = 0

Definition at line 11162 of file triangle.cpp.

segmentnumber

long segmentnumber

Definition at line 11167 of file triangle.cpp.

segmentorg

vertex segmentorg

Definition at line 8233 of file triangle.cpp.

shorg

vertex shorg

Definition at line 11154 of file triangle.cpp.

shortest

shortest = minaltitude

Definition at line 15360 of file triangle.cpp.

shouldbedelaunay

int shouldbedelaunay

Definition at line 6807 of file triangle.cpp.

sides

sides = 0

Definition at line 7115 of file triangle.cpp.

slist

slist = *segmentlist

Definition at line 14696 of file triangle.cpp.

smallest

int smallest

Definition at line 10327 of file triangle.cpp.

smallestangle

smallestangle = 0.0

Definition at line 15367 of file triangle.cpp.

smallestarea

smallestarea = minaltitude

Definition at line 15362 of file triangle.cpp.

smlist

smlist

Initial value:

{
#ifdef TRILIBRARY
  int *slist

Definition at line 14672 of file triangle.cpp.

sortarray

vertex * sortarray = (vertex *) trimalloc(m->invertices * (int) sizeof(vertex))

Definition at line 9206 of file triangle.cpp.

splayroot

struct splaynode * splayroot = splay(m, splayroot, searchvertex, searchtri)

Definition at line 10680 of file triangle.cpp.

splaytree

struct splaynode * splaytree

Definition at line 10561 of file triangle.cpp.

split

REAL split = (ey * etx - ex * ety) / denom

Definition at line 11712 of file triangle.cpp.

splitseg

struct osub * splitseg = 0

Definition at line 3313 of file triangle.cpp.

splitsubseg

snextself * splitsubseg

Definition at line 11693 of file triangle.cpp.

splitter

REAL splitter

Definition at line 646 of file triangle.cpp.

splittri

apex * splittri

Definition at line 11693 of file triangle.cpp.

sptr

subseg sptr

Definition at line 6811 of file triangle.cpp.

ss

subsegloop ss = (subseg) m->dummysub

Definition at line 4716 of file triangle.cpp.

ssorient

subsegloop ssorient = 0

Definition at line 4729 of file triangle.cpp.

startghost

otricopy * startghost

Definition at line 9915 of file triangle.cpp.

starttri

struct otri starttri

Definition at line 12153 of file triangle.cpp.

startvertex

vertex startvertex

Initial value:

{
  struct otri checktri

Definition at line 11607 of file triangle.cpp.

steiner

b steiner = -1

Definition at line 3317 of file triangle.cpp.

steinerleft

m steinerleft = b.steiner

Definition at line 15717 of file triangle.cpp.

stopatsubsegment

int stopatsubsegment

Definition at line 7503 of file triangle.cpp.

string

char infilename char* string

Definition at line 13807 of file triangle.cpp.

stringptr

char * stringptr = readline(inputline, elefile, elefilename)

Definition at line 11140 of file triangle.cpp.

subsegbytes

int subsegbytes

Definition at line 4197 of file triangle.cpp.

subsegloop

struct osub subsegloop

Definition at line 11148 of file triangle.cpp.

subsegmark

int subsegmark

Definition at line 7816 of file triangle.cpp.

subsegnumber

subsegnumber = b->firstnumber

Definition at line 14680 of file triangle.cpp.

success

enum insertvertexresult success = SUCCESSFULVERTEX

Definition at line 8236 of file triangle.cpp.

t

org* t

Definition at line 3671 of file triangle.cpp.

t0

REAL t0

Definition at line 5171 of file triangle.cpp.

t1

INEXACT REAL t1

Definition at line 5170 of file triangle.cpp.

talist

talist

Initial value:

{
#ifdef TRILIBRARY
  int *tlist

Definition at line 14525 of file triangle.cpp.

tapex

vertex tapex

Definition at line 6528 of file triangle.cpp.

tdest

vertex tdest

Definition at line 6527 of file triangle.cpp.

temp

vertex temp

Definition at line 9214 of file triangle.cpp.

temp16a

REAL temp16a[16]

Definition at line 5347 of file triangle.cpp.

temp16alen

int temp16alen

Definition at line 5349 of file triangle.cpp.

temp16b

REAL temp16b[16]

Definition at line 5347 of file triangle.cpp.

temp16blen

int temp16blen

Definition at line 5349 of file triangle.cpp.

temp16c

REAL temp16c[16]

Definition at line 5347 of file triangle.cpp.

temp16clen

int temp16clen

Definition at line 5349 of file triangle.cpp.

temp32a

REAL temp32a[32]

Definition at line 5348 of file triangle.cpp.

temp32alen

int temp32alen

Definition at line 5350 of file triangle.cpp.

temp32b

REAL temp32b[32]

Definition at line 5348 of file triangle.cpp.

temp32blen

int temp32blen

Definition at line 5350 of file triangle.cpp.

temp48

REAL temp48[48]

Definition at line 5348 of file triangle.cpp.

temp48len

int temp48len

Definition at line 5350 of file triangle.cpp.

temp64

REAL temp64[64]

Definition at line 5348 of file triangle.cpp.

temp64len

int temp64len

Definition at line 5350 of file triangle.cpp.

temp8

REAL temp8[8]

Definition at line 5347 of file triangle.cpp.

temp8len

int temp8len

Definition at line 5349 of file triangle.cpp.

tempedge

struct otri tempedge

Definition at line 8871 of file triangle.cpp.

tendegree

int tendegree

Definition at line 15372 of file triangle.cpp.

testsh

struct osub testsh

Definition at line 13248 of file triangle.cpp.

testsub

struct osub testsub

Initial value:

{
  struct otri tri1, tri2

Definition at line 7223 of file triangle.cpp.

testsubseg

ssym * testsubseg

Definition at line 7106 of file triangle.cpp.

testsym

struct osub testsym

Initial value:

{
  struct otri neighbortri

Definition at line 7111 of file triangle.cpp.

testtri

struct otri testtri

Initial value:

{
  struct otri enctri

Definition at line 7218 of file triangle.cpp.

testvertex

vertex testvertex

Definition at line 8873 of file triangle.cpp.

thisevent

thisevent = heap[eventnum]

Definition at line 10330 of file triangle.cpp.

ti0

REAL ti0

Definition at line 5344 of file triangle.cpp.

ti1

INEXACT REAL ti1

Definition at line 5343 of file triangle.cpp.

tj0

REAL tj0

Definition at line 5344 of file triangle.cpp.

tj1

INEXACT REAL tj1

Definition at line 5343 of file triangle.cpp.

tlist

tlist = *trianglelist

Definition at line 14553 of file triangle.cpp.

top

struct otri top

Initial value:

{
  struct otri horiz

Definition at line 7924 of file triangle.cpp.

toprcasing

struct otri botlcasing botrcasing toprcasing

Definition at line 7926 of file triangle.cpp.

topright

struct otri botleft botright topright

Initial value:

{
  struct otri botleft, botright

Definition at line 7923 of file triangle.cpp.

toprsubseg

struct osub botlsubseg botrsubseg toprsubseg

Definition at line 7928 of file triangle.cpp.

topvertex

vertex topvertex

Definition at line 8232 of file triangle.cpp.

topy

REAL topy

Definition at line 10726 of file triangle.cpp.

torg

vertex torg

Definition at line 6526 of file triangle.cpp.

totalpopulation

totalpopulation = m->triangles.maxitems

Definition at line 7657 of file triangle.cpp.

totalsamplesleft

totalsamplesleft = m->samples

Definition at line 7656 of file triangle.cpp.

tri

triangleloop tri = (triangle *) poolalloc(&m->triangles)

Definition at line 4672 of file triangle.cpp.

triangapex

newbad triangapex = enqapex

Definition at line 7030 of file triangle.cpp.

triangdest

newbad triangdest = enqdest

Definition at line 7032 of file triangle.cpp.

trianglearealist

REAL * trianglearealist

Definition at line 11099 of file triangle.cpp.

triangleattriblist

REAL ** triangleattriblist

Definition at line 11099 of file triangle.cpp.

trianglebytes

int trianglebytes

Definition at line 4193 of file triangle.cpp.

triangleleft

struct otri triangleleft

Definition at line 11144 of file triangle.cpp.

trianglelist

int ** trianglelist

Definition at line 11099 of file triangle.cpp.

triangleloop

struct otri triangleloop

Initial value:

{
  struct otri searchtri

Definition at line 11143 of file triangle.cpp.

triangorg

newbad triangorg = enqorg

Definition at line 7031 of file triangle.cpp.

triapex

vertex triapex

Definition at line 1368 of file triangle.cpp.

triarea

REAL triarea

Definition at line 15359 of file triangle.cpp.

triaspect2

REAL triaspect2

Definition at line 15365 of file triangle.cpp.

tridest

vertex tridest

Definition at line 1368 of file triangle.cpp.

triflaws

int triflaws

Definition at line 8210 of file triangle.cpp.

trilongest2

REAL trilongest2

Definition at line 15361 of file triangle.cpp.

triminaltitude2

REAL triminaltitude2

Definition at line 15363 of file triangle.cpp.

triorg

vertex triorg

Initial value:

{
  struct otri triangleloop

Definition at line 1369 of file triangle.cpp.

trisize

trisize

Initial value:

= ((b->order + 1) * (b->order + 2) / 2 + (m->highorderindex - 3)) *
            sizeof(triangle)

Definition at line 4329 of file triangle.cpp.

triswitches

void vorout char* triswitches

Definition at line 15674 of file triangle.cpp.

trisym

struct otri triangleloop trisym

Definition at line 14817 of file triangle.cpp.

tv0

gettimeofday& tv0

Definition at line 15708 of file triangle.cpp.

tv6

struct timeval tv0 tv1 tv2 tv3 tv4 tv5 tv6

Definition at line 15703 of file triangle.cpp.

tx

tx = tdest[0] - torg[0]

Definition at line 11710 of file triangle.cpp.

ty

ty = tdest[1] - torg[1]

Definition at line 11710 of file triangle.cpp.

tz

struct timezone tz

Definition at line 15704 of file triangle.cpp.

u

REAL u = u3

Definition at line 5168 of file triangle.cpp.

u3

INEXACT REAL u3

Definition at line 5169 of file triangle.cpp.

undeads

m undeads = 0

Definition at line 6649 of file triangle.cpp.

upperleft

vertex upperleft

Definition at line 9445 of file triangle.cpp.

upperright

vertex upperright

Definition at line 9445 of file triangle.cpp.

usesegments

b usesegments = b->poly || b->refine || b->quality || b->convex

Definition at line 3522 of file triangle.cpp.

v

REAL v

Definition at line 5345 of file triangle.cpp.

v3

INEXACT REAL v3

Definition at line 5346 of file triangle.cpp.

vararea

b vararea = b->fixedarea = b->usertest = 0

Definition at line 3304 of file triangle.cpp.

vedgefilename

char * vedgefilename

Definition at line 14959 of file triangle.cpp.

vedgelist

int ** vedgelist

Definition at line 14942 of file triangle.cpp.

vedgemarkerlist

* vedgemarkerlist = (int *) NULL

Definition at line 14942 of file triangle.cpp.

vedgenumber

vedgenumber = b->firstnumber

Definition at line 14985 of file triangle.cpp.

vertexarray

vertexarray

Initial value:

= (triangle *) trimalloc(m->vertices.items *
                                       (int) sizeof(triangle))

Definition at line 11149 of file triangle.cpp.

vertexindex

int vertexindex = 0

Definition at line 11246 of file triangle.cpp.

vertexloop

vertex vertexloop

Initial value:

{
  struct otri starttri

Definition at line 10234 of file triangle.cpp.

vertexmarkindex

m vertexmarkindex

Initial value:

= ((m->mesh_dim + m->nextras) * sizeof(REAL) +
                        sizeof(int) - 1) /
                       sizeof(int)

Definition at line 4283 of file triangle.cpp.

vertexnumber

int vertexnumber = b->firstnumber

Definition at line 14363 of file triangle.cpp.

vertexsize

vertexsize = (m->vertexmarkindex + 2) * sizeof(int)

Definition at line 4286 of file triangle.cpp.

vertices

int vertices

Definition at line 9750 of file triangle.cpp.

virusloop

triangle ** virusloop = (triangle **) traverse(&m->viri)

Definition at line 12669 of file triangle.cpp.

vlength

int vlength

Definition at line 6026 of file triangle.cpp.

vnodefilename

char * vnodefilename

Definition at line 14959 of file triangle.cpp.

vnodenumber

vnodenumber = b->firstnumber

Definition at line 14985 of file triangle.cpp.

vnormlist

REAL** vnormlist

Definition at line 14950 of file triangle.cpp.

vorout

struct triangulateio* vorout

Definition at line 15677 of file triangle.cpp.

vpointattriblist

REAL ** vpointattriblist

Definition at line 14941 of file triangle.cpp.

vpointlist

REAL ** vpointlist

Definition at line 14941 of file triangle.cpp.

vpointmarkerlist

* vpointmarkerlist = (int *) NULL

Definition at line 14941 of file triangle.cpp.

w

REAL w[16]

Definition at line 6024 of file triangle.cpp.

width

width

Initial value:

{
  struct otri inftri

Definition at line 10069 of file triangle.cpp.

wlength

wlength = scale_expansion_zeroelim(bctlen, bct, adheight, w)

Definition at line 6026 of file triangle.cpp.

workstring

workstring[increment+2] = 'd'

Definition at line 3301 of file triangle.cpp.

worstaspect

worstaspect = 0.0

Definition at line 15366 of file triangle.cpp.

x

REAL x

Initial value:

{
  vertex vertexloop

Definition at line 13906 of file triangle.cpp.

xab

xab = pa[0] - pb[0]

Definition at line 10512 of file triangle.cpp.

xac

REAL xac = pa[0] - pc[0]

Definition at line 10508 of file triangle.cpp.

xao

xao = tapex[0] - torg[0]

Definition at line 6546 of file triangle.cpp.

xbc

REAL xbc = pb[0] - pc[0]

Definition at line 10510 of file triangle.cpp.

xdo

xdo = tdest[0] - torg[0]

Definition at line 6544 of file triangle.cpp.

xi

REAL xi = (yao * dx - xao * dy) * (2.0 * denominator)

Definition at line 6530 of file triangle.cpp.

xminextreme

m xminextreme = 10 * m->xmin - 9 * m->xmax

Definition at line 14072 of file triangle.cpp.

y

REAL y

Definition at line 13906 of file triangle.cpp.

yab

yab = pa[1] - pb[1]

Definition at line 10513 of file triangle.cpp.

yac

REAL yac = pa[1] - pc[1]

Definition at line 10509 of file triangle.cpp.

yao

yao = tapex[1] - torg[1]

Definition at line 6547 of file triangle.cpp.

ybc

REAL ybc = pb[1] - pc[1]

Definition at line 10511 of file triangle.cpp.

ydo

ydo = tdest[1] - torg[1]

Definition at line 6545 of file triangle.cpp.