Go to the documentation of this file.
28 #define isatty _isatty
50 char hidden_options[]=
" d n v H U Qb QB Qc Qf Qg Qi Qm Qr QR Qv Qx TR E V FC Fi Fo Ft Fp FV Q0 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 ";
53 qdelaunay- compute the Delaunay triangulation\n\
54 http://www.qhull.org %s\n\
57 first lines: dimension and number of points (or vice-versa).\n\
58 other lines: point coordinates, best if one point per line\n\
59 comments: start with a non-numeric character\n\
62 Qu - compute furthest-site Delaunay triangulation\n\
63 Qt - triangulated output\n\
64 QJ - joggled input instead of merged facets\n\
66 Qhull control options:\n\
67 QJn - randomly joggle input in range [-n,n]\n\
70 Qs - search all points for the initial simplex\n\
71 Qz - add point-at-infinity to Delaunay triangulation\n\
72 QGn - print Delaunay region if visible from point n, -n if not\n\
73 QVn - print Delaunay regions that include point n, -n if not\n\
78 T4 - trace at level n, 4=all, 5=mem/gauss, -1= events\n\
79 Tc - check frequently during execution\n\
80 Ts - print statistics\n\
81 Tv - verify result: structure, convexity, and in-circle test\n\
82 Tz - send all output to stdout\n\
83 TFn - report summary when n or more facets created\n\
84 TI file - input data from file, no spaces or single quotes\n\
85 TO file - output results to file, may be enclosed in single quotes\n\
86 TPn - turn on tracing when point n added to hull\n\
87 TMn - turn on tracing at merge n\n\
88 TWn - trace merge facets when width > n\n\
89 TVn - stop qhull after adding point n, -n for before (see TCn)\n\
90 TCn - stop qhull after building cone for point n (see TVn)\n\
93 Cn - radius of centrum (roundoff added). Merge facets if non-convex\n\
94 An - cosine of maximum angle. Merge facets if cosine > n or non-convex\n\
95 C-0 roundoff, A-0.99/C-0.01 pre-merge, A0.99/C0.01 post-merge\n\
96 Rn - randomly perturb computations by a factor of [1-n,1+n]\n\
97 Wn - min facet width for outside point (before roundoff)\n\
99 Output formats (may be combined; if none, produces a summary to stdout):\n\
101 G - Geomview output (see below)\n\
102 i - vertices incident to each Delaunay region\n\
103 m - Mathematica output (2-d only, lifted to a paraboloid)\n\
104 o - OFF format (dim, points, and facets as a paraboloid)\n\
105 p - point coordinates (lifted to a paraboloid)\n\
106 s - summary (stderr)\n\
111 Fa - area for each Delaunay region\n\
112 FA - compute total area for option 's'\n\
113 Fc - count plus coincident points for each Delaunay region\n\
114 Fd - use cdd format for input (homogeneous with offset first)\n\
115 FD - use cdd format for numeric output (offset first)\n\
116 FF - facet dump without ridges\n\
117 FI - ID of each Delaunay region\n\
118 Fm - merge count for each Delaunay region (511 max)\n\
119 FM - Maple output (2-d only, lifted to a paraboloid)\n\
120 Fn - count plus neighboring region for each Delaunay region\n\
121 FN - count plus neighboring region for each point\n\
122 FO - options and precision constants\n\
123 FP - nearest point and distance for each coincident point\n\
124 FQ - command used for qdelaunay\n\
125 Fs - summary: #int (8), dimension, #points, tot vertices, tot facets,\n\
126 for output: #vertices, #Delaunay regions,\n\
127 #coincident points, #non-simplicial regions\n\
128 #real (2), max outer plane, min vertex\n\
129 FS - sizes: #int (0)\n\
130 #real (2), tot area, 0\n\
131 Fv - count plus vertices for each Delaunay region\n\
132 Fx - extreme points of Delaunay triangulation (on convex hull)\n\
136 Geomview options (2-d and 3-d)\n\
137 Ga - all points as dots\n\
138 Gp - coplanar points and vertices as radii\n\
139 Gv - vertices as spheres\n\
140 Gi - inner planes only\n\
142 Go - outer planes only\n\
144 Gh - hyperplane intersections\n\
146 GDn - drop dimension n in 3-d and 4-d output\n\
147 Gt - transparent outer ridges to view 3-d Delaunay\n\
150 PAn - keep n largest Delaunay regions by area\n\
151 Pdk:n - drop facet if normal[k] <= n (default 0.0)\n\
152 PDk:n - drop facet if normal[k] >= n\n\
153 Pg - print good Delaunay regions (needs 'QGn' or 'QVn')\n\
154 PFn - keep Delaunay regions whose area is at least n\n\
155 PG - print neighbors of good regions (needs 'QGn' or 'QVn')\n\
156 PMn - keep n Delaunay regions with most merges\n\
157 Po - force output. If error, output neighborhood of facet\n\
158 Pp - do not report precision problems\n\
160 . - list of all options\n\
161 - - one line descriptions of all options\n\
173 qdelaunay- compute the Delaunay triangulation. Qhull %s\n\
174 input (stdin): dimension, number of points, point coordinates\n\
175 comments start with a non-numeric character\n\
177 options (qdelaun.htm):\n\
178 Qu - furthest-site Delaunay triangulation\n\
179 Qt - triangulated output\n\
180 QJ - joggled input instead of merged facets\n\
181 Tv - verify result: structure, convexity, and in-circle test\n\
182 . - concise list of all options\n\
183 - - one-line description of all options\n\
186 output options (subset):\n\
187 s - summary of results (default)\n\
188 i - vertices incident to each Delaunay region\n\
189 Fx - extreme points (vertices of the convex hull)\n\
190 o - OFF format (shows the points lifted to a paraboloid)\n\
191 G - Geomview output (2-d and 3-d points lifted to a paraboloid)\n\
192 m - Mathematica output (2-d inputs lifted to a paraboloid)\n\
193 QVn - print Delaunay regions that include point n, -n if not\n\
194 TO file- output results to file, may be enclosed in single quotes\n\
197 rbox c P0 D2 | qdelaunay s o rbox c P0 D2 | qdelaunay i\n\
198 rbox c P0 D2 | qdelaunay Fv rbox c P0 D2 | qdelaunay s Qu Fv\n\
199 rbox c G1 d D2 | qdelaunay s i rbox c G1 d D2 | qdelaunay Qt\n\
200 rbox M3,4 z 100 D2 | qdelaunay s rbox M3,4 z 100 D2 | qdelaunay s Qt\n\
213 Except for 'F.' and 'PG', upper-case options take an argument.\n\
215 incidences mathematica OFF_format points_lifted summary\n\
218 Farea FArea_total Fcoincident Fd_cdd_in FD_cdd_out\n\
219 FF_dump_xridge FIDs Fmerges Fneighbors FNeigh_vertex\n\
220 FOptions FPoint_near FQdelaun Fsummary FSize\n\
221 Fvertices Fxtremes FMaple\n\
223 Gvertices Gpoints Gall_points Gno_planes Ginner\n\
224 Gcentrums Ghyperplanes Gridges Gouter GDrop_dim\n\
227 PArea_keep Pdrop d0:0D0 Pgood PFacet_area_keep\n\
228 PGood_neighbors PMerge_keep Poutput_forced Pprecision_not\n\
230 QGood_point QJoggle Qsearch_1st Qtriangulate QupperDelaunay\n\
231 QVertex_good Qzinfinite\n\
233 T4_trace Tcheck_often Tstatistics Tverify Tz_stdout\n\
234 TFacet_log TInput_file TPoint_trace TMerge_trace TOutput_file\n\
235 TWide_trace TVertex_stop TCone_stop\n\
237 Angle_max Centrum_size Random_dist Wide_outside\n\
255 int main(
int argc,
char *argv[]) {
256 int curlong, totlong;
257 int exitcode, numpoints,
dim;
263 if ((argc == 1) &&
isatty( 0 )) {
267 if (argc > 1 && *argv[1] ==
'-' && !*(argv[1]+1)) {
272 if (argc > 1 && *argv[1] ==
'.' && !*(argv[1]+1)) {
276 if (argc > 1 && *argv[1] ==
'-' && *(argv[1]+1)==
'V') {
280 qh_init_A(stdin, stdout, stderr, argc, argv);
281 exitcode= setjmp(
qh errexit);
284 qh_option(
"delaunay Qbbound-last", NULL, NULL);
299 if (
qh VERIFYoutput && !
qh FORCEoutput && !
qh STOPpoint && !
qh STOPcone)
309 if (curlong || totlong)
310 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_checkflags(char *command, char *hiddenflags)
int main(int argc, char *argv[])
void qh_check_points(void)
void qh_init_A(FILE *infile, FILE *outfile, FILE *errfile, int argc, char *argv[])
void qh_freeqhull(boolT allmem)
void qh_option(const char *option, int *i, realT *r)
coordT * qh_readpoints(int *numpoints, int *dimension, boolT *ismalloc)
void qh_produce_output(void)
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:14