Up
Next
repel - equilibrium of points repelling on a sphere
repel [options] [input_file]
An equilibrium position is found for a set of points which repel each
other. The initial coordinates are read from input_file if given (or
read from standard input), otherwise use -N to generate a random set.
- input_file
- input file in OFF format, if not given and option -N is not
given then the program will read from standard input
- -h
- program help
- -N <num>
- initialise with a number of randomly placed points
- -n <iters>
- number of iterations (default: no limit)
- -s <perc>
- percentage to shorten the travel distance (default: adaptive)
- -l <lim>
- minimum distance change to terminate, as negative exponent 1e-lim
(default: 13 giving 1e-13)
- -r <rep>
- repelling formula
- 1 - inverse of distance
- 2 - inverse square of distance (default)
- 3 - inverse cube of distance
- 4 - inverse square root of distance
- -o <file>
- write output to file, if this option is not used
the program writes to standard output
Make a snub cube
repel -N 24 -l 15 | conv_hull -o snub_cube.off
Make a snub cube in fewer iterations by not using adaptive shortening
repel -N 24 -s 1 -l 15 | conv_hull -o snub_cube.off
The default adaptive shortening of travel will not always be quickest.
It is worth experimenting with specific values using option -s.
However, in the snub cube examples above the adaptive shortening gives
better results, producing more accurate squares.
The progress report includes the number of iterations, the greatest
distance moved by a point, the shortening factor, and the sum of all
the forces.
If adaptive shortening is used then there is also a line of figures
showing the number of times out of ten that the shortening factor
was increased.
Up:
Programs and Documentation
Next:
minmax - optimal spherical tesselations
Antiprism Documentation 1.2.2007 -
http://www.antiprism.com/