Magic Cube

import org.distorted.main.RubikSurfaceView;

import static org.distorted.objects.FactoryCubit.COS18;

import static org.distorted.objects.FactoryCubit.COS54;

    return 3*((numLayers-3)/2)*((numLayers-5)/2) + (numLayers<5 ? 0:1);

    return numLayers<5 ? 0 : 2*(numLayers-4);

    return numLayers<5 ? 1 : numLayers/2 + 1;

    float[] cuts = new float[numLayers-1];

    float D = numLayers*MovementMinx.DIST3D;

    float E = 2*C1;           // 2*cos(36 deg)

    float X = 2*D*E/(1+2*E);  // height of the 'upper' part of a dodecahedron, i.e. put it on a table,

                              // its height is then D*2*DIST3D, it has one 'lower' part of height X, one

                              // 'middle' part of height Y and one upper part of height X again.

                              // It's edge length = numLayers/3.0f.

    int num = (numLayers-1)/2;

    float G = X*0.5f/num;     // height of one Layer

    for(int i=0; i<num; i++)

      {

      cuts[        i] = -D + (i+0.5f)*G;

      cuts[2*num-1-i] = -cuts[i];

      }

    return cuts;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

// Fill out mCurrCorner{X,Y,Z} by applying appropriate Quat to mBasicCorner{X,Y,Z}

// Appropriate one: QUATS[QUAT_INDICES[corner]].

  private void computeBasicCornerVectors(int corner)

    {

    Static4D quat = QUATS[QUAT_CORNER_INDICES[corner]];

    mCurrCornerV[0] = RubikSurfaceView.rotateVectorByQuat(mBasicCornerV[0],quat);

    mCurrCornerV[1] = RubikSurfaceView.rotateVectorByQuat(mBasicCornerV[1],quat);

    mCurrCornerV[2] = RubikSurfaceView.rotateVectorByQuat(mBasicCornerV[2],quat);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private float[] computeCorner(int numCubitsPerCorner, int numLayers, int corner, int part)

    {

    float D = numLayers/3.0f;

    float[] corn = CORNERS[corner];

    if( part==0 )

      {

      return new float[] { corn[0]*D, corn[1]*D, corn[2]*D };

      }

    else

      {

      float E = D/(0.5f*(numLayers-1));   // ?? maybe 0.5*

      int N = (numCubitsPerCorner-1)/3;

      int block = (part-1) % N;

      int index = (part-1) / N;

      Static4D pri = mCurrCornerV[index];

      Static4D sec = mCurrCornerV[(index+2)%3];

      int layers= (numLayers-5)/2;

      int multP = (block % layers) + 1;

      int multS = (block / layers);

      return new float[] {

                          corn[0]*D + (pri.get0()*multP + sec.get0()*multS)*E,

                          corn[1]*D + (pri.get1()*multP + sec.get1()*multS)*E,

                          corn[2]*D + (pri.get2()*multP + sec.get2()*multS)*E

                         };

      }

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private float[] computeCenter(int numLayers, int center, int part)

    {

    int corner = mCenterMap[center][part];

    float[] cent = mCenterCoords[center];

    float[] corn = CORNERS[corner];

    float D = numLayers/3.0f;

    float F = 1.0f - (2.0f*numLayers-6.0f)/(numLayers-1)*COS54*COS54;

    return new float[]

      {

        D * ( cent[0] + (corn[0]-cent[0])*F),

        D * ( cent[1] + (corn[1]-cent[1])*F),

        D * ( cent[2] + (corn[2]-cent[2])*F)

      };

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private int computeEdgeType(int cubit, int numCubitsPerCorner, int numCubitsPerEdge)

    {

    int part = (cubit - NUM_CORNERS*numCubitsPerCorner) % numCubitsPerEdge;

    return (part+1)/2;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private float[] computeEdge(int numLayers, int edge, int part)

    {

    float D = numLayers/3.0f;

    float[] c1 = CORNERS[ mEdgeMap[edge][0] ];

    float[] c2 = CORNERS[ mEdgeMap[edge][1] ];

    float x = D * (c1[0]+c2[0]) / 2;

    float y = D * (c1[1]+c2[1]) / 2;

    float z = D * (c1[2]+c2[2]) / 2;

    part /= 2;

    if( part==0 )

      {

      return new float[] { x, y, z };

      }

    else

      {

      int mult = (part+1)/2;

      int dir  = (part+1)%2;

      float[] center = mCenterCoords[ mEdgeMap[edge][dir+2] ];

      float vX = D*center[0] - x;

      float vY = D*center[1] - y;

      float vZ = D*center[2] - z;

      float A = mult*D*COS18/(numLayers-1);

      A /= (float)Math.sqrt(vX*vX+vY*vY+vZ*vZ);

      return new float[] { x+A*vX, y+A*vY, z+A*vZ };

      }

    if( numLayers<5 ) return CORNERS;

    int numCubitsPerCorner = numCubitsPerCorner(numLayers);

    int numCubitsPerEdge   = numCubitsPerEdge(numLayers);

    int numCubitsPerCenter = 5;

    int numCubits = NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge + NUM_CENTERS*numCubitsPerCenter;

    int index=0;

    final float[][] CENTERS = new float[numCubits][];

    for(int corner=0; corner<NUM_CORNERS; corner++)

      {

      computeBasicCornerVectors(corner);

      for(int part=0; part<numCubitsPerCorner; part++, index++)

        {

        CENTERS[index] = computeCorner(numCubitsPerCorner,numLayers,corner,part);

        }

      }

    for(int edge=0; edge<NUM_EDGES; edge++)

      {

      for(int part=0; part<numCubitsPerEdge; part++, index++)

        {

        CENTERS[index] = computeEdge(numLayers, edge, part );

        }

      }

    for(int center=0; center<NUM_CENTERS; center++, index++)

      {

      for(int part=0; part<numCubitsPerCenter; part++, index++)

        {

        CENTERS[index] = computeCenter(numLayers,center, part);

        }

      }

    return CENTERS;