String tileName = "6_4 6_4 - 2D";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,4,5, 6,7,8,9,10,11 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0},
{ 11,3,10,1,9,7, 8,5,6,4,2,0 },
{ 3 ,2,2 ,2,3,2, 2,2,2,3,2,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0,0, 1,0,1,0,0,0, 360 },
{ 0,1,0,1,0,0, 0,0,0,0,0,1, 360 },
{ 0,0,1,0,1,0, 0,0,0,0,1,0, 360 },
{ 0,0,0,0,0,1, 0,1,0,1,0,0, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,0,0,0,0, 0,0,0,0,0,1, 1,1 },
{ 0,1,0,1,0,0, 1,0,1,0,0,0, 2,2 }, // combined two
{ 0,0,1,0,0,0, 0,0,0,0,1,0, 1,1 },
{ 0,0,0,0,1,0, 0,0,0,1,0,0, 1,1 },
{ 0,0,0,0,0,1, 0,1,0,0,0,0, 1,1 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + n
__________________________
String tileName = "6_4 6_4 - 2C";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,4,5, 6,7,8,9,10,11 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0},
{ 11,3,10,1,9,7, 6,5,8,4,2,0 },
{ 3 ,2,2 ,2,3,3, 3,3,3,3,2,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0,0, 1,1,0,0,0,0, 360 },
{ 0,1,0,1,0,0, 0,0,0,0,0,1, 360 },
{ 0,0,1,0,1,0, 0,0,0,0,1,0, 360 },
{ 0,0,0,0,0,1, 0,0,1,1,0,0, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,0,0,0,0, 0,0,0,0,0,1, 1,1 },
{ 0,1,0,1,0,0, 0,0,0,0,0,0, 2,0 },
{ 0,0,1,0,0,0, 0,0,0,0,1,0, 1,1 },
{ 0,0,0,0,1,0, 0,0,0,1,0,0, 1,1 },
{ 0,0,0,0,0,1, 0,1,0,0,0,0, 1,1 },
{ 0,0,0,0,0,0, 1,0,0,0,0,0, 0,1 },
{ 0,0,0,0,0,1, 0,0,1,0,0,0, 0,1 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + n
__________________________
String tileName = "6_4 6_4 - 2B";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,4,5, 6,7,8,9,10,11 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0},
{ 11,1,10,3,9,7, 6,5,8,4,2,0 },
{ 3 ,3,3 ,3,3,3, 3,3,3,3,3,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0,0, 1,1,0,0,0,0, 360 },
{ 0,1,1,0,0,0, 0,0,0,0,0,1, 360 },
{ 0,0,0,1,1,0, 0,0,0,0,1,0, 360 },
{ 0,0,0,0,0,1, 0,0,1,1,0,0, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,0,0,0,0, 0,0,0,0,0,1, 1,1 },
{ 0,1,0,0,0,0, 0,0,0,0,0,0, 1,0 },
{ 0,0,1,0,0,0, 0,0,0,0,1,0, 1,1 },
{ 0,0,0,1,0,0, 0,0,0,0,0,0, 1,0 },
{ 0,0,0,0,1,0, 0,0,0,1,0,0, 1,1 },
{ 0,0,0,0,0,1, 0,1,0,0,0,0, 1,1 },
{ 0,0,0,0,0,0, 1,0,0,0,0,0, 0,1 },
{ 0,0,0,0,0,0, 0,0,1,0,0,0, 0,1 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + n
__________________________
String tileName = "6_4 6_4 - 2A";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,2,1, 6,7,8,7,6,11 },
{ 1,0,0,1,1,1, 0,0,1,1,1,1 },
{ 11,9,2,8,4,7, 6,5,3,1,10,0 },
{ 3 ,3,3,3,3,3, 3,3,3,3,3 ,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0,0, 1,1,0,0,0,0, 360 },
{ 0,1,0,0,0,0, 0,0,0,0,1,1, 360 },
{ 0,0,1,1,0,0, 0,0,0,1,0,0, 360 },
{ 0,0,0,0,1,1, 0,0,1,0,0,0, 360 },
{ 1,-1,0,0,0,0, 0,0,0,0,0,0, 0 },
{ 0,0,1,0,0,-1, 0,0,0,0,0,0, 0 },
{ 0,0,0,1,-1,0, 0,0,0,0,0,0, 0 },
{ 0,0,0,0,0,0, 1,0,0,0,0,-1, 0 },
{ 0,0,0,0,0,0, 0,1,0,0,-1,0, 0 },
{ 0,0,0,0,0,0, 0,0,1,-1,0,0, 0 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,0,0,0,0, 0,0,0,0,0,1, 1,1 },
{ 0,1,0,0,0,1, 0,1,0,1,0,0, 2,2 }, // symmetry
{ 0,0,1,0,1,0, 1,0,0,0,1,0, 2,2 }, // symmetry and two
{ 0,0,0,1,0,0, 0,0,1,0,0,0, 1,1 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + n
__________________________
String tileName = "6_4 6_4 - 1L";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,4,5, 6,7,8,9,10,11},
{ 0,0,0,0,0,0, 0,0,0,0,0 ,0 },
{ 11,4,7,8,1,10, 9,2,3,6,5,0 },
{ 3 ,3,3,3,3,3 , 3,3,3,3,3,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0,0, 1,0,0,0,1,0, 360 },
{ 0,1,0,0,0,1, 0,0,0,0,0,1, 360 },
{ 0,0,1,0,1,0, 0,0,1,0,0,0, 360 },
{ 0,0,0,1,0,0, 0,1,0,1,0,0, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,0,1,0,0, 0,0,0,0,0,0, 2,0 },
{ 0,1,0,0,1,0, 0,0,0,0,0,0, 2,0 },
{ 0,0,1,0,0,0, 0,1,0,0,0,0, 1,1 },
{ 0,0,0,1,0,0, 0,0,1,0,0,0, 1,1 },
{ 0,0,0,0,0,1, 0,0,0,0,1,0, 1,1 },
{ 0,0,0,0,0,0, 1,0,0,1,0,0, 0,2 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + n
________________________
String tileName = "6_4 6_4 - 1K";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,4,5, 6,7,8,9,10,11},
{ 0,0,0,0,0,0, 0,0,0,0,0 ,0 },
{ 11,4,8,7,1,10, 9,3,2,6,5,0 },
{ 3 ,3,2,2,3,3, 3,2,2,3,3,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0,0, 1,0,0,0,1,0, 360 },
{ 0,1,0,0,0,1, 0,0,0,0,0,1, 360 },
{ 0,0,1,0,1,0, 0,0,1,0,0,0, 360 },
{ 0,0,0,1,0,0, 0,1,0,1,0,0, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,0,0,0,0, 0,0,0,0,0,1, 1,1 },
{ 0,1,0,0,1,0, 1,0,0,1,0,0, 2,2 }, // two combined
{ 0,0,1,0,0,0, 0,0,1,0,0,0, 1,1 },
{ 0,0,0,1,0,0, 0,1,0,0,0,0, 1,1 },
{ 0,0,0,0,0,1, 0,0,0,0,1,0, 1,1 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + n
________________________
String tileName = "6_4 6_4 - 1J";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,4,5, 6,7,8,9,10,11},
{ 0,0,0,0,0,0, 0,0,0,0,0 ,0 },
{ 11,8,5,6,9,2, 3,10,1,4,7,0 },
{ 3 ,2,2,2,3,2, 2,2 ,2,3,2,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,1,0,0, 1,0,0,0,0,0, 360 },
{ 0,1,0,0,0,0, 0,0,1,0,0,1, 360 },
{ 0,0,1,0,0,1, 0,0,0,1,0,0, 360 },
{ 0,0,0,0,1,0, 0,1,0,0,1,0, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,0,0,0,0, 0,0,0,0,0,1, 1,1 },
{ 0,1,0,0,0,0, 0,0,1,0,0,0, 1,1 },
{ 0,0,1,0,0,1, 0,1,0,0,1,0, 2,2 }, // two combined
{ 0,0,0,1,0,0, 1,0,0,0,0,0, 1,1 },
{ 0,0,0,0,1,0, 0,0,0,1,0,0, 1,1 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + n
________________________
String tileName = "6_4 6_4 - 1I";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,4,5, 6,7,8,9,10,11},
{ 0,0,0,0,0,0, 0,0,0,0,0 ,0 },
{ 11,4,8,10,1,7, 6,5,2,9,3,0 },
{ 3 ,2,2,2 ,2,3, 3,3,2,3,2,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0,0, 1,1,0,0,0,0, 360 },
{ 0,1,0,0,1,0, 0,0,0,0,0,1, 360 },
{ 0,0,1,0,0,1, 0,0,1,0,0,0, 360 },
{ 0,0,0,1,0,0, 0,0,0,1,1,0, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,0,0,0,0, 0,0,0,0,0,1, 1,1 },
{ 0,1,0,0,1,0, 0,0,0,0,0,0, 2,0 },
{ 0,0,1,0,0,0, 0,0,1,0,0,0, 1,1 },
{ 0,0,0,1,0,0, 0,0,0,0,1,0, 1,1 },
{ 0,0,0,0,0,1, 0,1,0,0,0,0, 1,1 },
{ 0,0,0,0,0,0, 1,0,0,0,0,0, 0,1 },
{ 0,0,0,0,0,0, 0,0,0,1,0,0, 0,1 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + n
_______________________
String tileName = "6_4 6_4 - 1H";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,4,5, 6,7,8,9,10,11 },
{ 0,0,0,0,0,0, 0,0,0,0,0 ,0 },
{ 11,1,10,8,4,7, 6,5,3,9,2,0 },
{ 3 ,3,3 ,3,3,3, 3,3,3,3,3,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0,0, 1,1,0,0,0,0, 360 },
{ 0,1,1,0,0,0, 0,0,0,0,0,1, 360 },
{ 0,0,0,1,0,0, 0,0,0,1,1,0, 360 },
{ 0,0,0,0,1,1, 0,0,1,0,0,0, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,0,0,0,0, 0,0,0,0,0,1, 1,1 },
{ 0,1,0,0,0,0, 0,0,0,0,0,0, 1,0 },
{ 0,0,1,0,0,0, 0,0,0,0,1,0, 1,1 },
{ 0,0,0,1,0,0, 0,0,1,0,0,0, 1,1 },
{ 0,0,0,0,1,0, 0,0,0,0,0,0, 1,0 },
{ 0,0,0,0,0,1, 0,1,0,0,0,0, 1,1 },
{ 0,0,0,0,0,0, 1,0,0,0,0,0, 0,1 },
{ 0,0,0,0,0,0, 0,0,0,1,0,0, 0,1 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + n
________________________
String tileName = "6_4 6_4 - 1G";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,2,1, 6,7,8,6,7,8},
{ 1,0,0,1,1,1, 0,0,0,0,0,0},
{ 11,4,8,7,1,10, 9,3,2,6,5,0 },
{ 3 ,3,2,2,3,3 , 3,2,2,3,3,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0,0, 1,0,0,0,1,0, 360 },
{ 0,1,0,0,0,1, 0,0,0,0,0,1, 360 },
{ 0,0,1,0,1,0, 0,0,1,0,0,0, 360 },
{ 0,0,0,1,0,0, 0,1,0,1,0,0, 360 },
{ 1,0,0,-1,0,0, 0,0,0,0,0,0, 0 },
{ 0,1,-1,0,0,0, 0,0,0,0,0,0, 0 },
{ 0,0,0,0,1,-1, 0,0,0,0,0,0, 0 },
{ 0,0,0,0,0,0, 1,0,0,-1,0,0, 0 },
{ 0,0,0,0,0,0, 0,1,0,0,-1,0, 0 },
{ 0,0,0,0,0,0, 0,0,1,0,0,-1, 0 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,1,0,0,0, 0,0,1,0,0,1, 2,2 }, // symmetry
{ 0,1,0,0,1,0, 1,0,0,1,0,0, 2,2 }, // two combined
{ 0,0,0,1,0,1, 0,1,0,0,1,0, 2,2 } // symmetry
};
int tileLength = 6; // how many edge segments per tile - allow 6 + 2n
____________________
String tileName = "6_3 6_6 - 1E";
// we could check to see if type is right
int firstPolygonSize = 6;
int secondPolygonSize = 6;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,0,1,0,1, 6,6,6,6,6,6},
{ 0,0,0,0,0,0, 0,1,0,1,0,1},
{ 11,1,7,5,9,3, 4,2,2,4,0,0 },
{ 3 ,2,3,2,3,2, 2,3,2,3,2,3 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 0,0,0,0,0,0, 0,0,0,0,0,0 },
{ 1,1,1,1,1,1, 1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,1,0, 1,0,0,0,0,0, 360 },
{ 0,2,0,0,0,0, 0,0,0,0,0,1, 360 },
{ 0,0,2,0,0,0, 0,0,1,0,0,0, 360 },
{ 0,0,0,1,0,1, 0,1,0,0,0,0, 360 },
{ 0,0,0,1,0,1, 0,0,0,1,0,0, 360 },
{ 1,0,0,0,1,0, 0,0,0,0,1,0, 360 },
{ 1,0,-1,0,0,0, 0,0,0,0,0,0, 0 },
{ 1,0,0,0,-1,0, 0,0,0,0,0,0, 0 },
{ 0,1,0,-1,0,0, 0,0,0,0,0,0, 0 },
{ 0,1,0,0,0,-1, 0,0,0,0,0,0, 0 },
{ 0,0,0,0,0,0, 1,0,-1,0,0,0, 0 },
{ 0,0,0,0,0,0, 1,0,0,0,-1,0, 0 },
{ 0,0,0,0,0,0, 0,1,0,-1,0,0, 0 },
{ 0,0,0,0,0,0, 0,1,0,0,0,-1, 0 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1,1, 1,1,1,1,1,1, 6,6 },
{ 1,0,1,0,1,0, 1,1,1,1,1,1, 3,6 },
{ 0,1,0,1,0,1, 0,0,0,0,0,0, 3,0 }
};
int tileLength = 6; // how many edge segments per tile - allow 6 + 6n
______________________
String tileName = "5_4 7_4 - 1C";
// we could check to see if type is right
int firstPolygonSize = 5;
int secondPolygonSize = 7;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2,3,4, 5,6,7,8,9,10,11 },
{ 0,0,0,0,0, 0,0,0,0,0,0 ,0 },
{ 11,1,10,6,8, 9,3,7,4,5,2,0 },
{ 3 ,2,3 ,2,3, 2,2,3,2,2,3,3 },
{ 0,0,0,0,0, 0,0,0,0,0,0,0 },
{ 0,0,0,0,0, 0,0,0,0,0,0,0 },
{ 0,0,0,0,0, 0,0,0,0,0,0,0 },
{ 1,1,1,1,1, 1,1,1,1,1,1,1 }
};
int [][] netAngles = {
{ 1,0,0,0,0, 1,0,0,0,1,0,0, 360 },
{ 0,1,1,0,0, 0,0,0,0,0,0,1, 360 },
{ 0,0,0,1,0, 0,1,0,0,0,1,0, 360 },
{ 0,0,0,0,1, 0,0,1,1,0,0,0, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1,1,1, 1,1,1,1,1,1,1, 5,7 },
{ 1,0,0,0,0, 0,0,0,0,0,0,1, 1,1 },
{ 0,1,0,0,0, 0,0,0,0,0,0,0, 1,0 },
{ 0,0,1,0,0, 0,0,0,0,0,1,0, 1,1 },
{ 0,0,0,1,0, 0,1,0,0,0,0,0, 1,1 },
{ 0,0,0,0,1, 0,0,0,1,0,0,0, 1,1 },
{ 0,0,0,0,0, 1,0,0,0,1,0,0, 0,2 },
{ 0,0,0,0,0, 0,0,1,0,0,0,0, 0,1 }
};
int tileLength = 7; // how many edge segments per tile - allow 7 + n
______________________
String tileName = "3_2 4_2 - 14D";
// we could check to see if type is right
int firstPolygonSize = 3;
int secondPolygonSize = 4;
// 0-net symmetry, 1-net sym. map, 2-adjacent, 3-adj. map, 4-size
// 5-BeginAt, 6-orientation, 7-stepsize (stepsize is -1 or 1 from orientation)
int netEdgeData [][]= {
{ 0,1,2, 3,4,5,6 },
{ 0,0,0, 0,0,0,0 },
{ 6,3,2, 1,4,5,0 },
{ 3,3,3, 3,3,3,3 },
{ 0,0,0, 0,0,0,0 },
{ 0,0,0, 0,0,0,0 },
{ 0,0,0, 0,0,0,0 },
{ 1,1,1, 1,1,1,1 }
};
int [][] netAngles = {
{ 2,0,2, 2,0,0,0, 360 },
{ 0,1,0, 0,1,1,1, 360 }
};
// this array could be generated by the above...
int [][] netEdgeGrow = {
{ 1,1,1, 1,1,1,1, 3,4 },
{ 1,0,0, 0,0,0,1, 1,1 },
{ 0,1,0, 1,0,0,0, 1,1 },
{ 0,0,1, 0,0,0,0, 1,0 },
{ 0,0,0, 0,1,0,0, 0,1 },
{ 0,0,0, 0,0,1,0, 0,1 }
};
int tileLength = 4; // how many edge segments per tile - allow 4 + n
_____________________________
