Go to the documentation of this file.
31 #define isatty _isatty
49 qhull- compute convex hulls and related structures.\n\
50 http://www.qhull.org %s\n\
53 first lines: dimension and number of points (or vice-versa).\n\
54 other lines: point coordinates, best if one point per line\n\
55 comments: start with a non-numeric character\n\
56 halfspaces: use dim plus one and put offset after coefficients.\n\
57 May be preceded by a single interior point ('H').\n\
60 d - Delaunay triangulation by lifting points to a paraboloid\n\
61 d Qu - furthest-site Delaunay triangulation (upper convex hull)\n\
62 v - Voronoi diagram (dual of the Delaunay triangulation)\n\
63 v Qu - furthest-site Voronoi diagram\n\
64 Hn,n,... - halfspace intersection about point [n,n,0,...]\n\
65 Qt - triangulated output\n\
66 QJ - joggled input instead of merged facets\n\
67 Qc - keep coplanar points with nearest facet\n\
68 Qi - keep interior points with nearest facet\n\
70 Qhull control options:\n\
71 Qbk:n - scale coord k so that low bound is n\n\
72 QBk:n - scale coord k so that upper bound is n (QBk is %2.2g)\n\
73 QbB - scale input to unit cube centered at the origin\n\
74 Qbb - scale last coordinate to [0,m] for Delaunay triangulations\n\
75 Qbk:0Bk:0 - remove k-th coordinate from input\n\
76 QJn - randomly joggle input in range [-n,n]\n\
77 QRn - random rotation (n=seed, n=0 time, n=-1 time/no rotate)\n\
80 Qf - partition point to furthest outside facet\n\
81 Qg - only build good facets (needs 'QGn', 'QVn', or 'PdD')\n\
82 Qm - only process points that would increase max_outside\n\
83 Qr - process random outside points instead of furthest ones\n\
84 Qs - search all points for the initial simplex\n\
85 Qu - for 'd' or 'v', compute upper hull without point at-infinity\n\
86 returns furthest-site Delaunay triangulation\n\
87 Qv - test vertex neighbors for convexity\n\
88 Qx - exact pre-merges (skips coplanar and angle-coplanar facets)\n\
89 Qz - add point-at-infinity to Delaunay triangulation\n\
90 QGn - good facet if visible from point n, -n for not visible\n\
91 QVn - good facet if it includes point n, -n if not\n\
92 Q0 - turn off default premerge with 'C-0'/'Qx'\n\
93 Q1 - sort merges by type instead of angle\n\
94 Q2 - merge all non-convex at once instead of independent sets\n\
95 Q3 - do not merge redundant vertices\n\
96 Q4 - avoid old->new merges\n\
97 Q5 - do not correct outer planes at end of qhull\n\
98 Q6 - do not pre-merge concave or coplanar facets\n\
99 Q7 - depth-first processing instead of breadth-first\n\
100 Q8 - do not process near-inside points\n\
101 Q9 - process furthest of furthest points\n\
102 Q10 - no special processing for narrow distributions\n\
103 Q11 - copy normals and recompute centrums for tricoplanar facets\n\
104 Q12 - no error on wide merge due to duplicate ridge\n\
108 Topts- Trace options:\n\
109 T4 - trace at level n, 4=all, 5=mem/gauss, -1= events\n\
110 Ta - annotate output with message codes\n\
111 Tc - check frequently during execution\n\
112 Ts - print statistics\n\
113 Tv - verify result: structure, convexity, and point inclusion\n\
114 Tz - send all output to stdout\n\
115 TFn - report summary when n or more facets created\n\
116 TI file - input data from file, no spaces or single quotes\n\
117 TO file - output results to file, may be enclosed in single quotes\n\
118 TPn - turn on tracing when point n added to hull\n\
119 TMn - turn on tracing at merge n\n\
120 TWn - trace merge facets when width > n\n\
121 TRn - rerun qhull n times. Use with 'QJn'\n\
122 TVn - stop qhull after adding point n, -n for before (see TCn)\n\
123 TCn - stop qhull after building cone for point n (see TVn)\n\
125 Precision options:\n\
126 Cn - radius of centrum (roundoff added). Merge facets if non-convex\n\
127 An - cosine of maximum angle. Merge facets if cosine > n or non-convex\n\
128 C-0 roundoff, A-0.99/C-0.01 pre-merge, A0.99/C0.01 post-merge\n\
129 En - max roundoff error for distance computation\n\
130 Rn - randomly perturb computations by a factor of [1-n,1+n]\n\
131 Vn - min distance above plane for a visible facet (default 3C-n or En)\n\
132 Un - max distance below plane for a new, coplanar point (default Vn)\n\
133 Wn - min facet width for outside point (before roundoff, default 2Vn)\n\
135 Output formats (may be combined; if none, produces a summary to stdout):\n\
137 G - Geomview output (see below)\n\
138 i - vertices incident to each facet\n\
139 m - Mathematica output (2-d and 3-d)\n\
140 o - OFF format (dim, points and facets; Voronoi regions)\n\
141 n - normals with offsets\n\
142 p - vertex coordinates or Voronoi vertices (coplanar points if 'Qc')\n\
143 s - summary (stderr)\n\
148 Fa - area for each facet\n\
149 FA - compute total area and volume for option 's'\n\
150 Fc - count plus coplanar points for each facet\n\
151 use 'Qc' (default) for coplanar and 'Qi' for interior\n\
152 FC - centrum or Voronoi center for each facet\n\
153 Fd - use cdd format for input (homogeneous with offset first)\n\
154 FD - use cdd format for numeric output (offset first)\n\
155 FF - facet dump without ridges\n\
156 Fi - inner plane for each facet\n\
157 for 'v', separating hyperplanes for bounded Voronoi regions\n\
158 FI - ID of each facet\n\
159 Fm - merge count for each facet (511 max)\n\
160 FM - Maple output (2-d and 3-d)\n\
161 Fn - count plus neighboring facets for each facet\n\
162 FN - count plus neighboring facets for each point\n\
163 Fo - outer plane (or max_outside) for each facet\n\
164 for 'v', separating hyperplanes for unbounded Voronoi regions\n\
165 FO - options and precision constants\n\
166 Fp - dim, count, and intersection coordinates (halfspace only)\n\
167 FP - nearest vertex and distance for each coplanar point\n\
168 FQ - command used for qhull\n\
169 Fs - summary: #int (8), dimension, #points, tot vertices, tot facets,\n\
170 output: #vertices, #facets, #coplanars, #nonsimplicial\n\
171 #real (2), max outer plane, min vertex\n\
172 FS - sizes: #int (0)\n\
173 #real (2) tot area, tot volume\n\
174 Ft - triangulation with centrums for non-simplicial facets (OFF format)\n\
175 Fv - count plus vertices for each facet\n\
176 for 'v', Voronoi diagram as Voronoi vertices for pairs of sites\n\
177 FV - average of vertices (a feasible point for 'H')\n\
178 Fx - extreme points (in order for 2-d)\n\
182 Geomview options (2-d, 3-d, and 4-d; 2-d Voronoi)\n\
183 Ga - all points as dots\n\
184 Gp - coplanar points and vertices as radii\n\
185 Gv - vertices as spheres\n\
186 Gi - inner planes only\n\
188 Go - outer planes only\n\
190 Gh - hyperplane intersections\n\
192 GDn - drop dimension n in 3-d and 4-d output\n\
193 Gt - for 3-d 'd', transparent outer ridges\n\
196 PAn - keep n largest facets by area\n\
197 Pdk:n - drop facet if normal[k] <= n (default 0.0)\n\
198 PDk:n - drop facet if normal[k] >= n\n\
199 Pg - print good facets (needs 'QGn' or 'QVn')\n\
200 PFn - keep facets whose area is at least n\n\
201 PG - print neighbors of good facets\n\
202 PMn - keep n facets with most merges\n\
203 Po - force output. If error, output neighborhood of facet\n\
204 Pp - do not report precision problems\n\
206 . - list of all options\n\
207 - - one line descriptions of all options\n\
219 qhull- compute convex hulls and related structures. Qhull %s\n\
220 input (stdin): dimension, n, point coordinates\n\
221 comments start with a non-numeric character\n\
222 halfspace: use dim+1 and put offsets after coefficients\n\
224 options (qh-quick.htm):\n\
225 d - Delaunay triangulation by lifting points to a paraboloid\n\
226 d Qu - furthest-site Delaunay triangulation (upper convex hull)\n\
227 v - Voronoi diagram as the dual of the Delaunay triangulation\n\
228 v Qu - furthest-site Voronoi diagram\n\
229 H1,1 - Halfspace intersection about [1,1,0,...] via polar duality\n\
230 Qt - triangulated output\n\
231 QJ - joggled input instead of merged facets\n\
232 Tv - verify result: structure, convexity, and point inclusion\n\
233 . - concise list of all options\n\
234 - - one-line description of each option\n\
237 Output options (subset):\n\
238 s - summary of results (default)\n\
239 i - vertices incident to each facet\n\
240 n - normals with offsets\n\
241 p - vertex coordinates (if 'Qc', includes coplanar points)\n\
242 if 'v', Voronoi vertices\n\
243 Fp - halfspace intersections\n\
244 Fx - extreme points (convex hull vertices)\n\
245 FA - compute total area and volume\n\
246 o - OFF format (if 'v', outputs Voronoi regions)\n\
247 G - Geomview output (2-d, 3-d and 4-d)\n\
248 m - Mathematica output (2-d and 3-d)\n\
249 QVn - print facets that include point n, -n if not\n\
250 TO file- output results to file, may be enclosed in single quotes\n\
253 rbox D4 | qhull Tv rbox 1000 s | qhull Tv s FA\n\
254 rbox 10 D2 | qhull d QJ s i TO result rbox 10 D2 | qhull v Qbb Qt p\n\
255 rbox 10 D2 | qhull d Qu QJ m rbox 10 D2 | qhull v Qu QJ o\n\
256 rbox c d D2 | qhull Qc s f Fx | more rbox c | qhull FV n | qhull H Fp\n\
257 rbox d D12 | qhull QR0 FA rbox c D7 | qhull FA TF1000\n\
258 rbox y 1000 W0 | qhull rbox c | qhull n\n\
271 Except for 'F.' and 'PG', upper-case options take an argument.\n\
273 delaunay voronoi Geomview Halfspace facet_dump\n\
274 incidences mathematica normals OFF_format points\n\
277 Farea FArea-total Fcoplanars FCentrums Fd-cdd-in\n\
278 FD-cdd-out FF-dump-xridge Finner FIDs Fmerges\n\
279 Fneighbors FNeigh-vertex Fouter FOptions Fpoint-intersect\n\
280 FPoint_near FQhull Fsummary FSize Ftriangles\n\
281 Fvertices Fvoronoi FVertex-ave Fxtremes FMaple\n\
283 Gvertices Gpoints Gall_points Gno_planes Ginner\n\
284 Gcentrums Ghyperplanes Gridges Gouter GDrop_dim\n\
287 PArea-keep Pdrop d0:0D0 Pgood PFacet_area_keep\n\
288 PGood_neighbors PMerge-keep Poutput_forced Pprecision_not\n\
290 QbBound 0:0.5 Qbk:0Bk:0_drop QbB-scale-box Qbb-scale-last Qcoplanar\n\
291 Qfurthest Qgood_only QGood_point Qinterior Qmax_out\n\
292 QJoggle Qrandom QRotate Qsearch_1st Qtriangulate\n\
293 QupperDelaunay QVertex_good Qvneighbors Qxact_merge Qzinfinite\n\
295 Q0_no_premerge Q1_no_angle Q2_no_independ Q3_no_redundant Q4_no_old\n\
296 Q5_no_check_out Q6_no_concave Q7_depth_first Q8_no_near_in Q9_pick_furthest\n\
297 Q10_no_narrow Q11_trinormals Q12_no_wide_dup\n\
299 T4_trace Tannotate Tcheck_often Tstatistics Tverify\n\
300 Tz_stdout TFacet_log TInput_file TPoint_trace TMerge_trace\n\
301 TOutput_file TRerun TWide_trace TVertex_stop TCone_stop\n\
303 Angle_max Centrum_size Error_round Random_dist Visible_min\n\
304 Ucoplanar_max Wide_outside\n\
322 int main(
int argc,
char *argv[]) {
323 int curlong, totlong;
324 int exitcode, numpoints,
dim;
330 if ((argc == 1) &&
isatty( 0 )) {
334 if (argc > 1 && *argv[1] ==
'-' && !*(argv[1]+1)) {
339 if (argc > 1 && *argv[1] ==
'.' && !*(argv[1]+1)) {
343 if (argc > 1 && *argv[1] ==
'-' && *(argv[1]+1)==
'V') {
347 qh_init_A(stdin, stdout, stderr, argc, argv);
348 exitcode= setjmp(
qh errexit);
356 if (
qh VERIFYoutput && !
qh FORCEoutput && !
qh STOPpoint && !
qh STOPcone)
366 if (curlong || totlong)
367 qh_fprintf_stderr(6263,
"qhull internal warning (main): did not free %d bytes of long memory(%d pieces)\n",
void qh_fprintf_stderr(int msgcode, const char *fmt,...)
void qh_check_output(void)
void qh_check_points(void)
void qh_init_A(FILE *infile, FILE *outfile, FILE *errfile, int argc, char *argv[])
void qh_freeqhull(boolT allmem)
coordT * qh_readpoints(int *numpoints, int *dimension, boolT *ismalloc)
void qh_produce_output(void)
int main(int argc, char *argv[])
void qh_memfreeshort(int *curlong, int *totlong)
void qh_initflags(char *command)
void qh_init_B(coordT *points, int numpoints, int dim, boolT ismalloc)
hpp-fcl
Author(s):
autogenerated on Fri Aug 2 2024 02:45:15