graph
Class Constants

java.lang.Object
  |
  +--graph.Constants

public class Constants
extends java.lang.Object

This class contains all the constants that are needed for the graph generator as used in the proof of the Kepler conjecture. All constants have been converted to exact integer values by multiplying by 1000 and rouding in the correct direction.

class Constants : constants but no methods. class Parameter : use constants for things that don't require a graph. class Score : use constants for things that require a graph.


Inner Class Summary
static class Constants.Test
           
 
Field Summary
protected static int[] fixedScoreFace
          Entry[i] contains an upper bound on what is scored by a polygon with i edges.
protected static int[] fixedSquanderFace
          Entry[i] contains a lower bound on what is squandered by a polygon with i edges.
protected static int[][] fixedSquanderVertex
          This table appears in Kepler98.PartIII.Table 5.1.
static int scoreTarget
          Any graph scoring less than this amount is tossed out.
static int squanderTarget
          Any graph squandering more than this amount is tossed out.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

fixedSquanderFace

protected static final int[] fixedSquanderFace
Entry[i] contains a lower bound on what is squandered by a polygon with i edges. Values have been multiplied by 1000 and rounded down. Indices out of range correspond to faces that have too many faces to be allowed.

fixedScoreFace

protected static final int[] fixedScoreFace
Entry[i] contains an upper bound on what is scored by a polygon with i edges. Values have been multiplied by 1000 and rounded up. Indices out of range correspond to faces that have too many faces to be allowed.

squanderTarget

public static final int squanderTarget
Any graph squandering more than this amount is tossed out.

scoreTarget

public static final int scoreTarget
Any graph scoring less than this amount is tossed out.

fixedSquanderVertex

protected static final int[][] fixedSquanderVertex
This table appears in Kepler98.PartIII.Table 5.1. The entry[i][j] is a lower bound on what is squandered by the sum of all the faces around a vertex of type (i,j), where i is the number of triangles and j is the number of quadrilaterals.

For example, if there are p=0 triangles and q=3 quadrilaterals, then the 3 quadrilaterals squander at least 7.135 pt, corresponding to the entry 7135 in the table.