Up
Next
minmax - optimal spherical tesselations
minmax [options] [input_file]
Read a file in OFF format containing a graph of a polyhedron, with or without
vertex coordinates, and try to create a spherical tesselation where the
maximum edge is a minimum length.
- input_file
- input file in OFF format, or if not given the program reads from stdin
- -h
- program help
- -n <iters>
- number of iterations (default: 1000)
- -s <perc>
- percentage to shorten the maximum edge by (default 1%)
- -l <perc>
- percentage to lengthen the minimum edge by (default 1%)
- -p <mthd>
- method of placement onto a unit sphere
- n - project onto the sphere (default)
- r - random placement
- u - unscramble: place a small polygon on one side and the
rest of the vertices at a point on the other side
- -o <file>
- write output to file, if this option is not used
the program writes to standard output
Make a geometric representaation of a polyhedron having only face data
minmax -p u -n 100000 -o unscrambled.off scrambled.off
Run for a bit longer, don't need -p u this time
minmax -n 100000 -o unscrambled2.off unscrambled.off
Doesn't always succeed. An option to keep the spherical polygons convex
should improve it. The program shows the progress every 1000 iterations
by printing the longest and shortest edge lengths.
Up:
Programs and Documentation
Next:
OFF format description
Packinon Documentation 15.6.2005 -
http://packinon.sourceforge.net/