Lines Matching refs:boolT
102 #define boolT unsigned int macro
441 boolT ALLpoints; /* true 'Qs' if search all points for initial simplex */
442 boolT ANGLEmerge; /* true 'Qa' if sort potential merges by angle */
443 boolT APPROXhull; /* true 'Wn' if MINoutside set */
445 boolT ANNOTATEoutput; /* true 'Ta' if annotate output with message codes */
446 boolT ATinfinity; /* true 'Qz' if point num_points-1 is "at-infinity"
448 boolT AVOIDold; /* true 'Q4' if avoid old->new merges */
449 boolT BESToutside; /* true 'Qf' if partition points into best outsideset */
450 boolT CDDinput; /* true 'Pc' if input uses CDD format (1.0/offset first) */
451 boolT CDDoutput; /* true 'PC' if print normals in CDD format (offset first) */
452 boolT CHECKfrequently; /* true 'Tc' if checking frequently */
455 boolT DELAUNAY; /* true 'd' if computing DELAUNAY triangulation */
456 boolT DOintersections; /* true 'Gh' if print hyperplane intersections */
458 boolT FORCEoutput; /* true 'Po' if forcing output despite degeneracies */
461 boolT GOODthreshold; /* true if qh lower_threshold/upper_threshold defined
465 boolT HALFspace; /* true 'Hn,n,n' if halfspace intersection */
468 boolT KEEPcoplanar; /* true 'Qc' if keeping nearest facet for coplanar points */
469 boolT KEEPinside; /* true 'Qi' if keeping nearest facet for inside points
474 boolT MERGEexact; /* true 'Qx' if exact merges (coplanar, degen, dupridge, flipped) */
475 boolT MERGEindependent; /* true 'Q2' if merging independent sets */
476 boolT MERGING; /* true if exact-, pre- or post-merging, with angle and centrum tests */
479 boolT MERGEvertices; /* true 'Q3' if merging redundant vertices */
481 boolT NOnarrow; /* true 'Q10' if no special processing for narrow distributions */
482 boolT NOnearinside; /* true 'Q8' if ignore near-inside points when partitioning */
483 boolT NOpremerge; /* true 'Q0' if no defaults for C-0 or Qx */
484 boolT ONLYgood; /* true 'Qg' if process points with good visible or horizon facets */
485 boolT ONLYmax; /* true 'Qm' if only process points that increase max_outside */
486 boolT PICKfurthest; /* true 'Q9' if process furthest of furthest points*/
487 boolT POSTmerge; /* true if merging after buildhull (Cn or An) */
488 boolT PREmerge; /* true if merging during buildhull (C-n or A-n) */
490 boolT PRINTcentrums; /* true 'Gc' if printing centrums */
491 boolT PRINTcoplanar; /* true 'Gp' if printing coplanar points */
493 boolT PRINTdots; /* true 'Ga' if printing all points as dots */
494 boolT PRINTgood; /* true 'Pg' if printing good facets */
495 boolT PRINTinner; /* true 'Gi' if printing inner planes */
496 boolT PRINTneighbors; /* true 'PG' if printing neighbors of good facets */
497 boolT PRINTnoplanes; /* true 'Gn' if printing no planes */
498 boolT PRINToptions1st; /* true 'FO' if printing options to stderr */
499 boolT PRINTouter; /* true 'Go' if printing outer planes */
500 boolT PRINTprecision; /* false 'Pp' if not reporting precision problems */
502 boolT PRINTridges; /* true 'Gr' if print ridges */
503 boolT PRINTspheres; /* true 'Gv' if print vertices as spheres */
504 boolT PRINTstatistics; /* true 'Ts' if printing statistics to stderr */
505 boolT PRINTsummary; /* true 's' if printing summary to stderr */
506 boolT PRINTtransparent; /* true 'Gt' if print transparent outer ridges */
507 boolT PROJECTdelaunay; /* true if DELAUNAY, no readpoints() and
510 boolT QUICKhelp; /* true if quick help message for degen input */
511 boolT RANDOMdist; /* true if randomly change distplane and setfacetplane */
515 boolT RANDOMoutside; /* true if select a random outside point */
520 boolT SCALEinput; /* true 'Qbk' if scaling input */
521 boolT SCALElast; /* true 'Qbb' if scale last coord to max prev coord */
522 boolT SETroundoff; /* true 'E' if qh DISTround is predefined */
523 boolT SKIPcheckmax; /* true 'Q5' if skip qh_check_maxout */
524 boolT SKIPconvex; /* true 'Q6' if skip convexity testing during pre-merge */
525 boolT SPLITthresholds; /* true if upper_/lower_threshold defines a region
532 boolT TESTvneighbors; /* true 'Qv' if test vertex neighbors at end */
538 boolT TRIangulate; /* true 'Qt' if triangulate non-simplicial facets */
539 boolT TRInormals; /* true 'Q11' if triangulate duplicates normals (sets Qt) */
540 boolT UPPERdelaunay; /* true 'Qu' if computing furthest-site Delaunay */
541 boolT USEstdout; /* true 'Tz' if using stdout instead of stderr */
542 boolT VERIFYoutput; /* true 'Tv' if verify output at end of qhull */
543 boolT VIRTUALmemory; /* true 'Q7' if depth-first processing in buildhull */
544 boolT VORONOI; /* true 'v' if computing Voronoi diagram */
548 boolT DOcheckmax; /* true if calling qh_check_maxout (qh_initqhull_globals) */
551 …boolT GETarea; /* true 'Fa', 'FA', 'FS', 'PAn', 'PFn' if compute facet area/Voronoi volum…
552 boolT KEEPnearinside; /* true if near-inside points in coplanarset */
557 boolT POINTSmalloc; /* true if qh first_point/num_points allocated */
559 boolT input_malloc; /* true if qh input_points malloc'd */
568 boolT VERTEXneighbors; /* true if maintaining vertex neighbors */
569 boolT ZEROcentrum; /* true if 'C-0' or 'C-0 Qx'. sets ZEROall_ok */
602 boolT NARROWhull; /* set in qh_initialhull if angle < qh_MAXnarrow */
676 boolT ALLOWrestart; /* true if qh_precision can use qh.restartexit */
681 boolT hasAreaVolume; /* true if totarea, totvol was defined by qh_getarea */
682 boolT hasTriangulation; /* true if triangulation created by qh_triangulate */
684 boolT maxoutdone; /* set qh_check_maxout(), cleared by qh_addpoint() */
695 boolT NEWfacets; /* true while visible facets invalid due to new or merge
697 boolT findbestnew; /* true if partitioning calls qh_findbestnew */
698 boolT findbest_notsharp; /* true if new facets are at least 90 degrees */
699 boolT NOerrexit; /* true if qh.errexit is not available */
702 boolT POSTmerging; /* true when post merging */
705 boolT QHULLfinished; /* True after qhull() is finished */
710 boolT ZEROall_ok; /* True if qh_checkzero always succeeds */
711 boolT WAScoplanar; /* True if qh_partitioncoplanar (qh_check_maxout) */
753 boolT ERREXITcalled; /* true during qh_errexit (prevents duplicate calls */
754 boolT firstcentrum; /* for qh_printcentrum */
755 boolT old_randomdist; /* save RANDOMdist flag during io, tracing, or statistics */
995 boolT qh_addpoint(pointT *furthest, facetT *facet, boolT checkdist);
1002 int qh_new_qhull(int dim, int numpoints, coordT *points, boolT ismalloc,
1004 void qh_printfacetlist(facetT *facetlist, setT *facets, boolT printall);
1022 boolT bestoutside, boolT newfacets, boolT noupper,
1023 realT *dist, boolT *isoutside, int *numpart);
1025 realT *dist, boolT bestoutside, boolT *isoutside, int *numpart);
1026 boolT qh_gram_schmidt(int dim, realT **rows);
1042 void qh_freeqhull(boolT allmem);
1043 void qh_freeqhull2(boolT allmem);
1045 void qh_init_B(coordT *points, int numpoints, int dim, boolT ismalloc);
1047 void qh_initbuffers(coordT *points, int numpoints, int dim, boolT ismalloc);
1050 void qh_initqhull_globals(coordT *points, int numpoints, int dim, boolT ismalloc);
1066 void qh_printneighborhood(FILE *fp, qh_PRINT format, facetT *facetA, facetT *facetB, boolT print…
1068 coordT *qh_readpoints(int *numpoints, int *dimension, boolT *ismalloc);
1080 setT *qh_facetvertices(facetT *facetlist, setT *facets, boolT allfacets);
1081 facetT *qh_findbestfacet(pointT *point, boolT bestoutside,
1082 realT *bestdist, boolT *isoutside);