TABLE OF CONTENTS
Graphic (borrowed from Geomview Home Page) Cover
The Assignment 3
Printed Copy of Geomview Manual 10 to 110
rbox - generate point distributions for qhull
Command "rbox" (w/o arguments) lists the options.
rbox generates random or regular points according to the options given, and outputs the points to stdout. The points are generated in a cube, unless 's' or given. The format of the output is the following: first line contains the dimension and a c omment, second line contains the number of points, and the following lines contain the points, one point per line. Points are represented by their coordinate values.
n number of points
Dn dimension n-d (default 3-d)
many other options (refer to WWW home page)
C. Bradford Barber
c/o The Geometry Center
1300 South Second Street, Suite 500
Minneapolis, MN 55454
Qhull compute convex hulls, Delaunay triangulations, Voronoi vertices, and halfspace intersection.
Command "Qhull" (.) lists the options
(-) help message for all options
Qhull is a general dimension code for computing convex hulls, Delaunay triangulations, Voronoi vertices, and halfspace intersection. It implements the Quickhull algorithm for computing the convex hull. Qhull handles round-off errors from floating point ari thmetic. It can approximate a convex hull. Synopsis of Qhull
By default, Qhull computes the convex hull of the input points (description of qhull). The same code can also compute the following structures:
d Delaunay triangulation by lifting points to a paraboloid
v Voronoi vertices via the Delaunay triangulation
Hn,n halfspace intersection about point [n,n,0,...]
C-0 Qc handle precision problems by merging non-convex facets
A-0.9 merge facets if cosine of angle > 0.9
Qx handle precision problems in 5-d and higher
Tv verify result: structure, convexity, and point inclusion
s summary of results to stderr (default)
i vertices incident to each facet or Voronoi cell
o OFF file format for facets or Voronoi cells
n normals with offsets
p vertex or Voronoi vertex point coordinates
FA compute total area and volume for summary
G Geomview output (2-d, 3-d and 4-d)
m Mathematica output (2-d and 3-d)
f print all fields of all facets
Barber, C.B., Dobkin, D.P., and Huhdanpaa, H.T., "The Quickhull algorithm for
convex hulls," May 25, 1995, submitted to the ACM Trans. on Mathematical
What is Geomview?
Geomview is an interactive program, written by staff members of the Center for the Computation and Visualization of Geometric Structures, a National Science Foundation
Science and Technology Center at the University of Minnesota. Geomview is for viewing and manipulating geometric objects. It can be used as a standalone viewer for static objects or as a display engine for other programs which produce dynamically changing geometry.
It runs on Silicon Graphics (SGI) IRIS workstations and NeXT workstations. Also, an X11 version of Geomview currently exists and has been compiled on Linux, Sun sparc, HP Risc, IBM RS/6000 and Dec Alpha workstations.
A complete manual for Geomview is available online at the Geometry Center. A postscript version is available for download. Geomview binaries and source can be downloaded from the software library. Visit the Geometry Center on WWW at:
Tamara Munzner, Stuart Levy, and Mark Phillips are the original authors of Geomview. Celeste Fowler, Charlie Gunn, and Nathaniel Thurston also made significant contributions. Daniel Krech and Scott Wisdom did the NeXTStep and RenderMan port, and Daeron Mey er and Tim Rowley have worked on the port to X windows.
Version 1.5 of Geomview for X
Geomview (Sun4 binary, X11 version) (5.9 Meg)
Geomview (HP binary, X11 version) (3.8 Meg)
Geomview (Linux binary, X11 version) (4.4 Meg)
Geomview (DEC Alpha binary, X11 version) (4.4 Meg)
Geomview (IBM RS/6000 binary, X11 version) (4.3 Meg)
Geomview (source code) (4.5 Meg)