Up    Next

conway - Conway Notation transformations

Usage    |    Examples    |    Notes

Usage

Synopsis

conway [options] [conway_notation_string] [input_file]

Description

Read a polyhedron from a file in OFF format and apply transformations given in Conway Notation. Uses algorithms by George W. Hart, http://www.georgehart.com/.

Options

input_file
input file in OFF format, if not given and seed polyhedron not given then the program reads from standard input

-h
program help

-H
Conway Notation detailed help: seeds and operator descriptions

-d
don't simplify Conway Notation string

-r
execute operations in reverse order (left to right)

-t
use truncate algorithm instead of simplifying to "dkd", also used in ambo as a truncation of 1/2

-u
Make final polyhedron have unit average edge length

-v
verbose output

-o <file>
write output to file, if this option is not used the program writes to standard output

Canonicalization and Planarization options

-p <mthd>
inter-step planarization method

-c <mthd>
canonicalize final polyhedron using:

-n <iters>
maximum number of canonical iterations (default: no limit)

-l <lim>
minimum distance change to terminate canonicalization, as negative exponent 1e-lim (default: 13 giving 1e-13)

-i <itrs>
maximum number of inter-step planarization iterations (default: no limit)

-j <lim>
minimum distance change to terminate pre-planarize, as negative exponent 1e-lim (default: 13 giving 1e-13)

-z <n>
status reporting every n lines, -1 for no status (default: -1)

Coloring Options

-f <int>
face coloring method

-F <elems>
face colors. Default yellow,darkorange,red,darkgreen,black,blue white,magenta. Valid color names and indexes are in X11 map or use only index numbers if -M map is used (index numbers wrap) key word: seq,n - uses map colors in sequential order starting at optional map index number n

-T <tran>
face transparency in range from 0 to 255, 0 - invisible, 255 - opaque (default: 255)

-O <pat>
face transparency pattern string. Valid values, 0 - T value suppressed 1 - T value applied (default '1')

-M <file>
map color indexes into color values using colour map file

-N
write color indexes to output. Transparency settings ignored

Examples

A truncated octahedron
   conway tk4Y4 | antiview
A Great rhombicuboctahedron with coloured faces
   conway -c m -f 1 dmO | antiview
A snub geodesic sphere
   geodesic 3 | conway -f 1 s | antiview
A snub pentagrammic antiprism
   conway s ant5/2 | antiview

Notes

conway was written by Roger Kaufman. The Conway Notation algorithms were adapted from the Javascript on George Hart's Conway Notation page.

Canonicalization and planarization may not always converge on a convex polyhedron.

George Hart has a page on canonicalization. The 'Mathematica' algorithms have been written to follow his Mathematica implementation

Up: Programs and Documentation
Next: poly_kscope - polyhedral kaleidoscope

Antiprism Documentation 5.1.2008 - http://www.antiprism.com/