waterman - Waterman polyhedra

Usage

Usage: waterman [options] lattice

Use sphere-ray intersection for producing Waterman Polyhedra. Lattice can be
SC, FCC, or BCC

Options
  -h,--help this help message (run 'off_util -H help' for general help)
  --version version information
  -v        verbose output (on computational errors)
  -l <lim>  minimum distance for unique vertex locations as negative exponent
               (default: 12 giving 1e-12)
  -o <file> write output to file (default: write to standard output)

Program Options
  -r <r,n>  clip radius. r is radius taken to optional root n. n = 2 is sqrt
  -q <cent> center of lattice, three comma separated coordinates
               0 for origin  (default: origin)
  -m <mthd> 1 - sphere-ray intersection  2 - z guess (default: 1)
  -f        fill interior points (not for -C c)
  -t        defeat computational error testing for sphere-ray method

Scene Options
  -C <opt>  c - convex hull only, i - keep interior, s - suppress (default: c)

Coloring Options (run 'off_util -H color' for help on color formats)
  -V <col>  model vertex color (default: none)
  -E <col>  edge color (for convex hull, default: none)
  -F <col>  face color (for convex hull, default: none)
               lower case outputs map indexes. upper case outputs color values
               keyword: s,S color by symmetry using face normals
               keyword: c,C color by symmetry using face normals (chiral)
  -Z <col>  fill vertex color (default: model vertex color)
  -T <tran> face transparency. valid range from 0 (invisible) to 255 (opaque)

Examples

waterman -r rt20 fcc | antiview

waterman -r rt100 fcc -F S | antiview

waterman -q 0.5,0.5,0.5 -r rt100 fcc -F S | antiview

Notes

For more details about these polyhedra see Waterman Polyhedra on Steve Waterman's site.

The program uses an efficient algorithm that makes it suitable for calculating Waterman polyhedra up to root 1,000,000 and more.

     Next: sph_rings - rings of points on a sphere
     Up: Programs and Documentation