#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include "libqhull.h"
#include "mem.h"
#include "qset.h"
Go to the source code of this file.
Function Documentation
| int main |
( |
int |
argc, |
|
|
char * |
argv[] |
|
) |
| |
Variable Documentation
| char hidden_options[] = " d n v Qbb QbB Qf Qg Qm Qr QR Qv Qx Qz TR E V Fa FA FC FD FS Ft FV Gt Q0 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 " |
Initial value:"\n\
qhalf- halfspace intersection about a point. Qhull %s\n\
input (stdin): [dim, 1, interior point], dim+1, n, coefficients+offset\n\
comments start with a non-numeric character\n\
\n\
options (qhalf.htm):\n\
Hn,n - specify coordinates of interior point\n\
Qt - triangulated output\n\
QJ - joggled input instead of merged facets\n\
Tv - verify result: structure, convexity, and redundancy\n\
. - concise list of all options\n\
- - one-line description of all options\n\
\n\
output options (subset):\n\
s - summary of results (default)\n\
Fp - intersection coordinates\n\
Fv - non-redundant halfspaces incident to each intersection\n\
Fx - non-redundant halfspaces\n\
o - OFF file format (dual convex hull)\n\
G - Geomview output (dual convex hull)\n\
m - Mathematica output (dual convex hull)\n\
QVn - print intersections for halfspace n, -n if not\n\
TO file - output results to file, may be enclosed in single quotes\n\
\n\
examples:\n\
rbox d | qconvex FQ n | qhalf s H0,0,0 Fp\n\
rbox c | qconvex FQ FV n | qhalf s i\n\
rbox c | qconvex FQ FV n | qhalf s o\n\
\n\
"
Definition at line 177 of file qhalf.c.
Initial value:"\n\
Qhull %s.\n\
Except for 'F.' and 'PG', upper_case options take an argument.\n\
\n\
incidences Geomview mathematica OFF_format point_dual\n\
summary facet_dump\n\
\n\
Fc_redundant Fd_cdd_in FF_dump_xridge FIDs Fmerges\n\
Fneighbors FN_intersect FOptions Fp_coordinates FP_nearest\n\
FQhalf Fsummary Fv_halfspace FMaple Fx_non_redundant\n\
\n\
Gvertices Gpoints Gall_points Gno_planes Ginner\n\
Gcentrums Ghyperplanes Gridges Gouter GDrop_dim\n\
\n\
PArea_keep Pdrop d0:0D0 Pgood PFacet_area_keep\n\
PGood_neighbors PMerge_keep Poutput_forced Pprecision_not\n\
\n\
Qbk:0Bk:0_drop Qcoplanar QG_half_good Qi_redundant QJoggle\n\
Qsearch_1st Qtriangulate 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 215 of file qhalf.c.
Initial value:"\n\
qhalf- compute the intersection of halfspaces about a point\n\
http://www.qhull.org %s\n\
\n\
input (stdin):\n\
optional interior point: dimension, 1, coordinates\n\
first lines: dimension+1 and number of halfspaces\n\
other lines: halfspace coefficients followed by offset\n\
comments: start with a non-numeric character\n\
\n\
options:\n\
Hn,n - specify coordinates of interior point\n\
Qt - triangulated output\n\
QJ - joggled input instead of merged facets\n\
Qc - keep coplanar halfspaces\n\
Qi - keep other redundant halfspaces\n\
\n\
Qhull control options:\n\
QJn - randomly joggle input in range [-n,n]\n\
%s%s%s%s"
Definition at line 58 of file qhalf.c.
Initial value:"\
Qbk:0Bk:0 - remove k-th coordinate from input\n\
Qs - search all halfspaces for the initial simplex\n\
QGn - print intersection if visible to halfspace n, -n for not\n\
QVn - print intersections for halfspace n, -n if not\n\
\n\
"
Definition at line 78 of file qhalf.c.
Initial value:"\
More formats:\n\
Fc - count plus redundant halfspaces for each intersection\n\
- Qc (default) for coplanar and Qi for other redundant\n\
Fd - use cdd format for input (homogeneous with offset first)\n\
FF - facet dump without ridges\n\
FI - ID of each intersection\n\
Fm - merge count for each intersection (511 max)\n\
FM - Maple output (dual convex hull)\n\
Fn - count plus neighboring intersections for each intersection\n\
FN - count plus intersections for each non-redundant halfspace\n\
FO - options and precision constants\n\
Fp - dim, count, and intersection coordinates\n\
FP - nearest halfspace and distance for each redundant halfspace\n\
FQ - command used for qhalf\n\
Fs - summary: #int (8), dim, #halfspaces, #non-redundant, #intersections\n\
for output: #non-redundant, #intersections, #coplanar\n\
halfspaces, #non-simplicial intersections\n\
#real (2), max outer plane, min vertex\n\
Fv - count plus non-redundant halfspaces for each intersection\n\
Fx - non-redundant halfspaces\n\
\n\
"
Definition at line 119 of file qhalf.c.
Initial value:"\
Geomview output (2-d, 3-d and 4-d; dual convex hull)\n\
Ga - all points (i.e., transformed halfspaces) as dots\n\
Gp - coplanar points and vertices as radii\n\
Gv - vertices (i.e., non-redundant halfspaces) as spheres\n\
Gi - inner planes (i.e., halfspace intersections) 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 (i.e., intersections) 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\
"
Definition at line 142 of file qhalf.c.
