#include "libqhull_r/libqhull_r.h"#include <stdio.h>#include <stdlib.h>#include <string.h>#include <ctype.h>#include <math.h>
Include dependency graph for qconvex_r.c:
Go to the source code of this file.
Functions | |
| int | isatty (int) |
| int | main (int argc, char *argv[]) |
Variables | |
| char | hidden_options [] =" d v H Qbb Qf Qg Qm Qr Qu Qv Qx Qz TR E V Fp Gt Q0 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 " |
| char | qh_prompt2 [] |
| char | qh_prompt3 [] |
| char | qh_prompta [] |
| char | qh_promptb [] |
| char | qh_promptc [] |
| char | qh_promptd [] |
| char | qh_prompte [] |
Function Documentation
◆ isatty()
| int isatty | ( | int | ) |
◆ main()
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 270 of file qconvex_r.c.
Variable Documentation
◆ hidden_options
| char hidden_options[] =" d v H Qbb Qf Qg Qm Qr Qu Qv Qx Qz TR E V Fp Gt Q0 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 " |
Definition at line 49 of file qconvex_r.c.
◆ qh_prompt2
| char qh_prompt2[] |
Definition at line 182 of file qconvex_r.c.
◆ qh_prompt3
| char qh_prompt3[] |
Initial value:
= "\n\
Qhull %s.\n\
Except for 'F.' and 'PG', upper-case options take an argument.\n\
\n\
incidences mathematica normals OFF_format points\n\
summary facet_dump\n\
\n\
Farea FArea_total Fcoplanars FCentrums Fd_cdd_in\n\
FD_cdd_out FFacet_xridge Finner FIDs Fmerges\n\
Fneighbors FNeigh_vertex Fouter FOptions FPoint_near\n\
FQhull Fsummary FSize Fvertices FVertex_ave\n\
Fxtremes FMaple\n\
\n\
Gvertices Gpoints Gall_points Gno_planes Ginner\n\
Gcentrums Ghyperplanes Gridges Gouter GDrop_dim\n\
\n\
PArea_keep Pdrop d0:0D0 PFacet_area_keep Pgood PGood_neighbors\n\
PMerge_keep Poutput_forced Pprecision_not\n\
\n\
QbBound 0:0.5 QbB_scale_box Qcoplanar QGood_point Qinterior\n\
QJoggle Qrandom QRotate Qsearch_1st Qtriangulate\n\
QVertex_good\n\
\n\
T4_trace Tcheck_often Tstatistics Tverify Tz_stdout\n\
TFacet_log TInput_file TPoint_trace TMerge_trace TOutput_file\n\
TWide_trace TVertex_stop TCone_stop\n\
\n\
Angle_max Centrum_size Random_dist Ucoplanar_max Wide_outside\n\
"
Definition at line 225 of file qconvex_r.c.
◆ qh_prompta
| char qh_prompta[] |
Initial value:
= "\n\
qconvex- compute the convex hull\n\
http://www.qhull.org %s\n\
\n\
input (stdin):\n\
first lines: dimension and number of points (or vice-versa).\n\
other lines: point coordinates, best if one point per line\n\
comments: start with a non-numeric character\n\
\n\
options:\n\
Qt - triangulated output\n\
QJ - joggled input instead of merged facets\n\
Qc - keep coplanar points with nearest facet\n\
Qi - keep interior points with nearest facet\n\
\n\
Qhull control options:\n\
Qbk:n - scale coord k so that low bound is n\n\
QBk:n - scale coord k so that upper bound is n (QBk is %2.2g)\n\
QbB - scale input to unit cube centered at the origin\n\
Qbk:0Bk:0 - remove k-th coordinate from input\n\
QJn - randomly joggle input in range [-n,n]\n\
QRn - random rotation (n=seed, n=0 time, n=-1 time/no rotate)\n\
%s%s%s%s"
Definition at line 51 of file qconvex_r.c.
◆ qh_promptb
| char qh_promptb[] |
Initial value:
= "\
Qs - search all points for the initial simplex\n\
QGn - good facet if visible from point n, -n for not visible\n\
QVn - good facet if it includes point n, -n if not\n\
\n\
"
Definition at line 74 of file qconvex_r.c.
◆ qh_promptc
| char qh_promptc[] |
Definition at line 80 of file qconvex_r.c.
◆ qh_promptd
| char qh_promptd[] |
Definition at line 115 of file qconvex_r.c.
◆ qh_prompte
| char qh_prompte[] |
Initial value:
= "\
Geomview output (2-d, 3-d, and 4-d)\n\
Ga - all points as dots\n\
Gp - coplanar points and vertices as radii\n\
Gv - vertices as spheres\n\
Gi - inner planes only\n\
Gn - no planes\n\
Go - outer planes only\n\
Gc - centrums\n\
Gh - hyperplane intersections\n\
Gr - ridges\n\
GDn - drop dimension n in 3-d and 4-d output\n\
\n\
Print options:\n\
PAn - keep n largest facets by area\n\
Pdk:n - drop facet if normal[k] <= n (default 0.0)\n\
PDk:n - drop facet if normal[k] >= n\n\
Pg - print good facets (needs 'QGn' or 'QVn')\n\
PFn - keep facets whose area is at least n\n\
PG - print neighbors of good facets\n\
PMn - keep n facets with most merges\n\
Po - force output. If error, output neighborhood of facet\n\
Pp - do not report precision problems\n\
\n\
. - list of all options\n\
- - one line descriptions of all options\n\
-V - version\n\
"
Definition at line 146 of file qconvex_r.c.