/opt/ros/diamondback/stacks/graspit_simulator/graspit/graspit_source/qhull/unix.c File Reference
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include "qhull.h"
#include "mem.h"
#include "set.h"
Go to the source code of this file.
Function Documentation
| int main |
( |
int |
argc, |
|
|
char * |
argv[] | |
|
) |
| | |
Variable Documentation
Initial value: "\n\
Qhull %s. Upper-case options [not 'F.' or 'PG'] use number\n\
\n\
delaunay voronoi Halfspace facet_dump Geomview \n\
incidences mathematica normals points off_file\n\
summary\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-intersect\n\
FPoint_near FQhull Fsummary FSize\n\
Ftriangles Fvertices Fvoronoi FVertex-ave Fxtremes\n\
Gvertices Gpoints Gall_points Gno_planes Ginner\n\
Gcentrums Ghyperplanes Gridges Gouter GDrop_dim\n\
Gtransparent PArea-keep Pdrop d0:0D0 Pgood PFacet_area_keep\n\
PGood_neighbors PMerge-keep Poutput_forced Pprecision_not\n\
QbBound 0:0.5 QbB-scale-box Qbb-scale-last Qcoplanar\n\
Qfurthest Qgood_only QGood_point Qinterior Qmax_out\n\
QJoggle Qrandom QRotate Qsearch_1st QupperDelaunay\n\
QVertex_good Qvneighbors Qxact_merge Qzinfinite Q0_no_premerge\n\
Q1_no_angle Q2_no_independ Q3_no_redundant Q4_no_old Q5_no_check_out\n\
Q6_no_concave Q7_depth_first Q8_no_near_in Q9_pick_furthest T4_trace\n\
Tcheck_often Tstatistics Tverify Tz_stdout TFacet_log\n\
TPoint_trace TMerge_trace TOoutput_file TRerun TWide_trace\n\
TVertex_stop TCone_stop Angle_max Centrum_size\n\
Error_round Random_dist Visible_min Ucoplanar_max Wide_outside\n\
"
Definition at line 263 of file unix.c.
Initial value: "\n\
qhull- compute convex hulls and related structures.\n\
http://www.geom.umn.edu/locate/qhull %s\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\
halfspaces: use dim plus one and put offset after coefficients.\n\
May be preceeded by a single interior point ('H').\n\
\n\
options:\n\
d - Delaunay triangulation by lifting points to a paraboloid\n\
v - Voronoi diagram from the Delaunay triangulation\n\
Hn,n,... - halfspace intersection about [n,n,0,...]\n\
d Qu - furthest-site Delaunay triangulation (upper convex hull)\n\
v Qu - furthest-site Voronoi diagram\n\
QJ - joggle input instead of merging facets\n\
\n\
Qopts- 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\n\
Qbb - scale last coordinate to [0,m] for Delaunay triangulations\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 61 of file unix.c.
Initial value: "\
Qc - keep coplanar points with nearest facet\n\
Qf - partition point to furthest outside facet\n\
Qg - only build good facets (needs 'QGn', 'QVn', or 'PdD')\n\
Qm - only process points that would increase max_outside\n\
Qi - keep interior points with nearest facet\n\
Qr - process random outside points instead of furthest ones\n\
Qs - search all points for the initial simplex\n\
Qu - for 'd', compute upper hull without point at-infinity\n\
returns furthest-site Delaunay triangulation\n\
Qv - test vertex neighbors for convexity\n\
Qx - exact pre-merges (skips coplanar and angle coplanar facets)\n\
Qz - add point-at-infinity to Delaunay triangulation\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\
Q0 - turn off default premerge with 'C-0'/'Qx'\n\
Q1 - sort merges by type instead of angle\n\
Q2 - merge all non-convex at once instead of independent sets\n\
Q3 - do not merge redundant vertices\n\
Q4 - avoid old->new merges\n\
Q5 - do not correct outer planes at end of qhull\n\
Q6 - do not pre-merge concave or coplanar facets\n\
Q7 - depth-first processing instead of breadth-first\n\
Q8 - do not process near-inside points\n\
Q9 - process furthest of furthest points\n\
"
Definition at line 88 of file unix.c.
Initial value: "\
Gopts- Geomview output (2-d, 3-d and 4-d; 2-d Voronoi)\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\
Gt - transparent outer ridges to view 3-d Delaunay\n\
Popts- 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\
"
Definition at line 180 of file unix.c.
