Functions | Variables
qvoronoi.c File Reference
#include "libqhull/libqhull.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
Include dependency graph for qvoronoi.c:

Go to the source code of this file.

Functions

int isatty (int)
 
int main (int argc, char *argv[])
 

Variables

char hidden_options [] =" d n m v H U Qb QB Qc Qf Qg Qi Qm Qr QR Qv Qx TR E V Fa FA FC Fp FS Ft FV Pv 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 243 of file qvoronoi.c.

Variable Documentation

◆ hidden_options

char hidden_options[] =" d n m v H U Qb QB Qc Qf Qg Qi Qm Qr QR Qv Qx TR E V Fa FA FC Fp FS Ft FV Pv Gt Q0 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 "

Definition at line 52 of file qvoronoi.c.

◆ qh_prompt2

char qh_prompt2[]
Initial value:
= "\n\
qvoronoi- compute the Voronoi diagram. Qhull %s\n\
input (stdin): dimension, number of points, point coordinates\n\
comments start with a non-numeric character\n\
\n\
options (qvoronoi.htm):\n\
Qu - compute furthest-site Voronoi diagram\n\
Tv - verify result: structure, convexity, and in-circle test\n\
. - concise list of all options\n\
- - one-line description of all options\n\
-V - version\n\
\n\
output options (subset):\n\
s - summary of results (default)\n\
p - Voronoi vertices\n\
o - OFF file format (dim, Voronoi vertices, and Voronoi regions)\n\
FN - count and Voronoi vertices for each Voronoi region\n\
Fv - Voronoi diagram as Voronoi vertices between adjacent input sites\n\
Fi - separating hyperplanes for bounded regions, 'Fo' for unbounded\n\
G - Geomview output (2-d only)\n\
QVn - Voronoi vertices for input point n, -n if not\n\
TO file- output results to file, may be enclosed in single quotes\n\
\n\
examples:\n\
rbox c P0 D2 | qvoronoi s o rbox c P0 D2 | qvoronoi Fi\n\
rbox c P0 D2 | qvoronoi Fo rbox c P0 D2 | qvoronoi Fv\n\
rbox c P0 D2 | qvoronoi s Qu Fv rbox c P0 D2 | qvoronoi Qu Fo\n\
rbox c G1 d D2 | qvoronoi s p rbox c P0 D2 | qvoronoi s Fv QV0\n\
\n\
"

Definition at line 165 of file qvoronoi.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\
OFF_format p_vertices i_delaunay summary facet_dump\n\
\n\
Fcoincident Fd_cdd_in FD_cdd_out FF-dump-xridge Fi_bounded\n\
Fxtremes Fmerges Fneighbors FNeigh_region FOptions\n\
Fo_unbounded FPoint_near FQvoronoi Fsummary Fvoronoi\n\
FIDs\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\
QG_vertex_good Qsearch_1st Qupper_voronoi QV_point_good Qzinfinite\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 Wide_outside\n\
"

Definition at line 203 of file qvoronoi.c.

◆ qh_prompta

char qh_prompta[]
Initial value:
= "\n\
qvoronoi- compute the Voronoi diagram\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\
Qu - compute furthest-site Voronoi diagram\n\
\n\
Qhull control options:\n\
Qz - add point-at-infinity to Voronoi diagram\n\
%s%s%s%s"

Definition at line 54 of file qvoronoi.c.

◆ qh_promptb

char qh_promptb[]
Initial value:
= "\
Qs - search all points for the initial simplex\n\
QGn - Voronoi vertices if visible from point n, -n if not\n\
QVn - Voronoi vertices for input point n, -n if not\n\
\n\
"

Definition at line 69 of file qvoronoi.c.

◆ qh_promptc

char qh_promptc[]

Definition at line 75 of file qvoronoi.c.

◆ qh_promptd

char qh_promptd[]
Initial value:
= "\
More formats:\n\
Fc - count plus coincident points (by Voronoi vertex)\n\
Fd - use cdd format for input (homogeneous with offset first)\n\
FD - use cdd format for output (offset first)\n\
FF - facet dump without ridges\n\
Fi - separating hyperplanes for bounded Voronoi regions\n\
FI - ID for each Voronoi vertex\n\
Fm - merge count for each Voronoi vertex (511 max)\n\
Fn - count plus neighboring Voronoi vertices for each Voronoi vertex\n\
FN - count and Voronoi vertices for each Voronoi region\n\
Fo - separating hyperplanes for unbounded Voronoi regions\n\
FO - options and precision constants\n\
FP - nearest point and distance for each coincident point\n\
FQ - command used for qvoronoi\n\
Fs - summary: #int (8), dimension, #points, tot vertices, tot facets,\n\
for output: #Voronoi regions, #Voronoi vertices,\n\
#coincident points, #non-simplicial regions\n\
#real (2), max outer plane and min vertex\n\
Fv - Voronoi diagram as Voronoi vertices between adjacent input sites\n\
Fx - extreme points of Delaunay triangulation (on convex hull)\n\
\n\
"

Definition at line 106 of file qvoronoi.c.

◆ qh_prompte

char qh_prompte[]
Initial value:
= "\
Geomview options (2-d only)\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 Voronoi vertices 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 Voronoi vertices (needs 'QGn' or 'QVn')\n\
PFn - keep Voronoi vertices whose 'area' is at least n\n\
PG - print neighbors of good Voronoi vertices\n\
PMn - keep n Voronoi vertices 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 129 of file qvoronoi.c.



hpp-fcl
Author(s):
autogenerated on Fri Jun 2 2023 02:39:02