Lines Matching refs:boolT
101 #define boolT unsigned int macro
433 boolT ALLpoints; /* true 'Qs' if search all points for initial simplex */
434 boolT ANGLEmerge; /* true 'Qa' if sort potential merges by angle */
435 boolT APPROXhull; /* true 'Wn' if MINoutside set */
437 boolT ANNOTATEoutput; /* true 'Ta' if annotate output with message codes */
438 boolT ATinfinity; /* true 'Qz' if point num_points-1 is "at-infinity"
440 boolT AVOIDold; /* true 'Q4' if avoid old->new merges */
441 boolT BESToutside; /* true 'Qf' if partition points into best outsideset */
442 boolT CDDinput; /* true 'Pc' if input uses CDD format (1.0/offset first) */
443 boolT CDDoutput; /* true 'PC' if print normals in CDD format (offset first) */
444 boolT CHECKfrequently; /* true 'Tc' if checking frequently */
447 boolT DELAUNAY; /* true 'd' if computing DELAUNAY triangulation */
448 boolT DOintersections; /* true 'Gh' if print hyperplane intersections */
450 boolT FORCEoutput; /* true 'Po' if forcing output despite degeneracies */
453 boolT GOODthreshold; /* true if qh lower_threshold/upper_threshold defined
457 boolT HALFspace; /* true 'Hn,n,n' if halfspace intersection */
460 boolT KEEPcoplanar; /* true 'Qc' if keeping nearest facet for coplanar points */
461 boolT KEEPinside; /* true 'Qi' if keeping nearest facet for inside points
466 boolT MERGEexact; /* true 'Qx' if exact merges (coplanar, degen, dupridge, flipped) */
467 boolT MERGEindependent; /* true 'Q2' if merging independent sets */
468 boolT MERGING; /* true if exact-, pre- or post-merging, with angle and centrum tests */
471 boolT MERGEvertices; /* true 'Q3' if merging redundant vertices */
473 boolT NOnarrow; /* true 'Q10' if no special processing for narrow distributions */
474 boolT NOnearinside; /* true 'Q8' if ignore near-inside points when partitioning */
475 boolT NOpremerge; /* true 'Q0' if no defaults for C-0 or Qx */
476 boolT ONLYgood; /* true 'Qg' if process points with good visible or horizon facets */
477 boolT ONLYmax; /* true 'Qm' if only process points that increase max_outside */
478 boolT PICKfurthest; /* true 'Q9' if process furthest of furthest points*/
479 boolT POSTmerge; /* true if merging after buildhull (Cn or An) */
480 boolT PREmerge; /* true if merging during buildhull (C-n or A-n) */
482 boolT PRINTcentrums; /* true 'Gc' if printing centrums */
483 boolT PRINTcoplanar; /* true 'Gp' if printing coplanar points */
485 boolT PRINTdots; /* true 'Ga' if printing all points as dots */
486 boolT PRINTgood; /* true 'Pg' if printing good facets */
487 boolT PRINTinner; /* true 'Gi' if printing inner planes */
488 boolT PRINTneighbors; /* true 'PG' if printing neighbors of good facets */
489 boolT PRINTnoplanes; /* true 'Gn' if printing no planes */
490 boolT PRINToptions1st; /* true 'FO' if printing options to stderr */
491 boolT PRINTouter; /* true 'Go' if printing outer planes */
492 boolT PRINTprecision; /* false 'Pp' if not reporting precision problems */
494 boolT PRINTridges; /* true 'Gr' if print ridges */
495 boolT PRINTspheres; /* true 'Gv' if print vertices as spheres */
496 boolT PRINTstatistics; /* true 'Ts' if printing statistics to stderr */
497 boolT PRINTsummary; /* true 's' if printing summary to stderr */
498 boolT PRINTtransparent; /* true 'Gt' if print transparent outer ridges */
499 boolT PROJECTdelaunay; /* true if DELAUNAY, no readpoints() and
502 boolT QUICKhelp; /* true if quick help message for degen input */
503 boolT RANDOMdist; /* true if randomly change distplane and setfacetplane */
507 boolT RANDOMoutside; /* true if select a random outside point */
512 boolT SCALEinput; /* true 'Qbk' if scaling input */
513 boolT SCALElast; /* true 'Qbb' if scale last coord to max prev coord */
514 boolT SETroundoff; /* true 'E' if qh DISTround is predefined */
515 boolT SKIPcheckmax; /* true 'Q5' if skip qh_check_maxout */
516 boolT SKIPconvex; /* true 'Q6' if skip convexity testing during pre-merge */
517 boolT SPLITthresholds; /* true if upper_/lower_threshold defines a region
524 boolT TESTvneighbors; /* true 'Qv' if test vertex neighbors at end */
530 boolT TRIangulate; /* true 'Qt' if triangulate non-simplicial facets */
531 boolT TRInormals; /* true 'Q11' if triangulate duplicates normals (sets Qt) */
532 boolT UPPERdelaunay; /* true 'Qu' if computing furthest-site Delaunay */
533 boolT USEstdout; /* true 'Tz' if using stdout instead of stderr */
534 boolT VERIFYoutput; /* true 'Tv' if verify output at end of qhull */
535 boolT VIRTUALmemory; /* true 'Q7' if depth-first processing in buildhull */
536 boolT VORONOI; /* true 'v' if computing Voronoi diagram */
540 boolT DOcheckmax; /* true if calling qh_check_maxout (qh_initqhull_globals) */
543 …boolT GETarea; /* true 'Fa', 'FA', 'FS', 'PAn', 'PFn' if compute facet area/Voronoi volum…
544 boolT KEEPnearinside; /* true if near-inside points in coplanarset */
549 boolT POINTSmalloc; /* true if qh first_point/num_points allocated */
551 boolT input_malloc; /* true if qh input_points malloc'd */
560 boolT VERTEXneighbors; /* true if maintaining vertex neighbors */
561 boolT ZEROcentrum; /* true if 'C-0' or 'C-0 Qx'. sets ZEROall_ok */
594 boolT NARROWhull; /* set in qh_initialhull if angle < qh_MAXnarrow */
668 boolT ALLOWrestart; /* true if qh_precision can use qh.restartexit */
673 boolT hasAreaVolume; /* true if totarea, totvol was defined by qh_getarea */
674 boolT hasTriangulation; /* true if triangulation created by qh_triangulate */
676 boolT maxoutdone; /* set qh_check_maxout(), cleared by qh_addpoint() */
687 boolT NEWfacets; /* true while visible facets invalid due to new or merge
689 boolT findbestnew; /* true if partitioning calls qh_findbestnew */
690 boolT findbest_notsharp; /* true if new facets are at least 90 degrees */
691 boolT NOerrexit; /* true if qh.errexit is not available */
694 boolT POSTmerging; /* true when post merging */
697 boolT QHULLfinished; /* True after qhull() is finished */
702 boolT ZEROall_ok; /* True if qh_checkzero always succeeds */
703 boolT WAScoplanar; /* True if qh_partitioncoplanar (qh_check_maxout) */
745 boolT ERREXITcalled; /* true during qh_errexit (prevents duplicate calls */
746 boolT firstcentrum; /* for qh_printcentrum */
747 boolT old_randomdist; /* save RANDOMdist flag during io, tracing, or statistics */
987 boolT qh_addpoint(pointT *furthest, facetT *facet, boolT checkdist);
994 int qh_new_qhull(int dim, int numpoints, coordT *points, boolT ismalloc,
996 void qh_printfacetlist(facetT *facetlist, setT *facets, boolT printall);
1014 boolT bestoutside, boolT newfacets, boolT noupper,
1015 realT *dist, boolT *isoutside, int *numpart);
1017 realT *dist, boolT bestoutside, boolT *isoutside, int *numpart);
1018 boolT qh_gram_schmidt(int dim, realT **rows);
1034 void qh_freeqhull(boolT allmem);
1035 void qh_freeqhull2(boolT allmem);
1037 void qh_init_B(coordT *points, int numpoints, int dim, boolT ismalloc);
1039 void qh_initbuffers(coordT *points, int numpoints, int dim, boolT ismalloc);
1042 void qh_initqhull_globals(coordT *points, int numpoints, int dim, boolT ismalloc);
1058 void qh_printneighborhood(FILE *fp, qh_PRINT format, facetT *facetA, facetT *facetB, boolT print…
1060 coordT *qh_readpoints(int *numpoints, int *dimension, boolT *ismalloc);
1072 setT *qh_facetvertices(facetT *facetlist, setT *facets, boolT allfacets);
1073 facetT *qh_findbestfacet(pointT *point, boolT bestoutside,
1074 realT *bestdist, boolT *isoutside);