Up    Next

canonical - canonicalize a polyhedon

Usage    |    Examples    |    Notes

Usage

Synopsis

canonical [options] [input_file]

Description

Read a polyhedron from a file in OFF format. Canonicalize it using George Hart's algorithm.

Options

input_file
input file in OFF format, or if not given the program reads from stdin

-h
program help

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

-e <perc>
percentage to scale the edge tangency error (default: 50)

-p <perc>
percentage to scale the face planarity error (default: 20)

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

-C <cent>
initial 'centering', x - none, c - centroid, s - centroid and project vertices onto a sphere (default)

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

Examples

Make a cube, distort it, and canonicalize it back into a cube 
   unipoly cube | off_trans -S 1,2,3 | canonical > canonic_cube.off

Notes

The program will not always converge, and produce the canonical form. In this cases it may help to distort the polyhedron before running canonical. This could be done with off_util -S, repel, minmax, off_trans or even editing the OFF file by hand.

The current implementation has been written to follow George Hart's Mathematica implementation

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

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