tetra59 - 59 tetrahedra with rational dihedral angles

Usage

Usage: tetra59 [options] tetrahedron

Generate 59 Tetrahedra with Rational Dihedral Angles in off format. The 59
Sporadic Tetrahedra is from a paper by Kiran S. Kedlaya, Alexander Kolpakov,
Bjorn Poonen, and Michael Rubinstein: Space Vectors Forming Rational Angles
The paper can be found at: https://arxiv.org/abs/2011.14232
There are also two special infinite cases included in the findings
The first case was published by M.J.M Hill in 1895. The second case is new.

Options
  -h,--help this help message (run 'off_util -H help' for general help)
  --version version information
  -H        abstract from the paper and description of regge symmetry
  -L <opt>  list Sporadic Tetrahedra as i - integer, d - degrees, p - pairs
  -v <opt>  verbose output math: e - edges, f - faces, p - pairs, a - all
  -o <file> write output to file (default: write to standard output)

Scene Options
  -d <mthd> order of dihedral angles, for matching dihedral angle at position
            term 1 (a12) for regge symmetry (also permutes special cases) 
            angles permuted as pairs: 1-(a12,a34) 2-(a13,a24) 3-(a14,a23)
            for each pair in position one, there are two arrangements
            (a:1,2,3 b:1,3,2); (c:2,1,3 d:2,3,1); (e:3,1,2 f:3,2,1) (default:a)
  -p <int>  build regge pair if found (1 or 2) not for special cases (sets -z)
  -P <n,d>  force second pair of model number n, and method d (not with -p)
  -r        reflect
  -z        scale volume to 1

Special Cases
  -s <int>  special case 1 or 2 (default: none)
              case 1: (pi/2, pi/2, pi - 2x, pi/3, x, x)
                        for pi/6 < x < pi/2 (30 < x < 90 degrees)
              case 2: (5pi/6 - x, pi/6 + x, 2pi/3 - x, 2pi/3 - x, x, x)
                        for pi/6 < x <= pi/3 (30 < x <= 60 degrees)
  -a <ang>  angle in degrees (default: 45)
  -w        allow any angle for case s (for testing case 2, 60 < x < 90
              which seems to yield a tetrahedron) 
           
Coloring Options (run 'off_util -H color' for help on color formats)
keyword: none - sets no color
  -F <col>  color the faces according to: (default: u)
              a color value - apply to all faces
              u - unique color
              s - symmetric coloring [,sub_group,conj_type]
              r - regge group (1-16) (not for special cases)
  -E <col>  color the edges according to: (default: lightgray)
              a color value - apply to all edges
              s - symmetric coloring [,sub_group,conj_type]
  -V <col>  color the vertices according to: (default: gold)
              a color value - apply to all vertices
              s - symmetric coloring [,sub_group,conj_type]
  -T <t,e>  transparency. from 0 (invisible) to 255 (opaque). element is any
            or all of, v - vertices, e - edges, f - faces, a - all (default: f)
  -m <maps> a comma separated list of color maps used to transform color
            indexes (default: compound), a part consisting of letters from
            v, e, f, selects the element types to apply the map list to
            (default 'vef'). use map name of 'index' to output index numbers
              compound:   yellow,red,darkgreen,blue,magenta,cyan,darkorange1
              rainbow16:  (special map for -F r)

Examples

tetra59 -L i

tetra59 -L d

tetra59 -L p

tetra59 12 | antiview -v 0.01

tetra59 48 -F r | antiview -v 0.01

tetra59 -s 2 -a 40 | antiview -v 0.01

tetra59 24 -z > tmp.off
tetra59 29 -z | antiview - tmp.off

tetra59 13 -d c -p 1 | antiview

Notes

The following extended help for the program may be displayed with tetra59 -H

The project was undertaken in memory of John H. Conway

Abstract. We classify all sets of nonzero vectors in R3 such that the angle
formed by each pair is a rational multiple of Pi .The special case of
four-element subsets lets us classify all tetrahedra whose dihedral angles are
multiples of Pi, solving a 1976 problem of Conway and Jones: there are 2
one-parameter families and 59 sporadic tetrahedra, all but three of which are
related to either the icosidodecahedron or the B3 root lattice. The proof
requires the solution in roots of unity of a W(D6)-symmetric polynomial
equation with 105 monomials (the previous record was 12 monomials).

A brief description of a Regge Symmetry group, a mathematical symmetry.

For all the tetrahedra in a Regge Symmetry group, if given equal volume they
will have the following characteristics

1) For all the tetrahedrons in the group, the sum of the 6 edges will be equal
2) In the group, for a tetrahedron with edges (x,y,a,b,c,d) there may be one
   or more tetrahedrons with edges x,y,s-a,s-b,s-c,s-d where s = (a+b+c+d)/2
   The tetrahedra come in pairs by dihedral angle. There may be more than one
   pairing depending on the three sets of opposing angles. Of the pairings...
3) The two opposing dihedral angles at edges x and y will be equal
4) The edge lengths of x and y of the two tetrahedra will be equal
5) If e,f,g,h are the dihedral angles at the edges a,b,c,d then the dihedral
   angles at edges s-a,s-b,s-c,s-d are t-e,t-f,t-g,t-h where t = (e+f+g+h)/2
   
For more information see: https://arxiv.org/abs/1903.04929

Method of Building Tetrahedrons

The tetrahedrons vertices are numbered 1,2,3 and 4. The dihedral angles given
for the six edges from the paper are (a12,a34,a13,a24,a14,a23). An edge length
of 1 is drawn from the origin to x,y,z = 0,1,0. Face angles for face A and B
are calculated from dihedral angles using trigonometry. Edge a (e13) and
edge b (e14) lengths are calculated from face angles from A and B angles using
trigonometry. Edge a (e13) is drawn rotated into place on the xy plane. Edge
b (e14) is also drawn and rotated on the xy plane and additionally rotated on
the Y axis by dihedral angle a12. At this point 4 vertices exist in 3D space
and the four faces A, B, C and D can be drawn.

Comparing Two Tetrahedra in the Same Regge Group

In a Regge group, two tetrahedra that share the same dihedral angle pair can
be compared and Regge symmetry math demonstrated. Not all angle pairs are in
the same columns pairs. The -d option can choose which order to place the 
dihedral pairs so that the pairs to be compared will be moved to the first
column. The -p option will find the pairing if it exists and move its order
to the first column. -p can take 1 or 2 depending on which order it picks for
the second and third column. The listing -l deg to list the 59 tetrahedra in
terms of degrees will help see which pairing are valid.

     Next: iso_delta - isohedral deltahedra
     Up: Programs and Documentation