Distorted Android

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

// Copyright 2016 Leszek Koltunski                                                               //

//                                                                                               //

// This file is part of Distorted.                                                               //

//                                                                                               //

// Distorted is free software: you can redistribute it and/or modify                             //

// it under the terms of the GNU General Public License as published by                          //

// the Free Software Foundation, either version 2 of the License, or                             //

// (at your option) any later version.                                                           //

//                                                                                               //

// Distorted is distributed in the hope that it will be useful,                                  //

// but WITHOUT ANY WARRANTY; without even the implied warranty of                                //

// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the                                 //

// GNU General Public License for more details.                                                  //

//                                                                                               //

// You should have received a copy of the GNU General Public License                             //

// along with Distorted.  If not, see <http://www.gnu.org/licenses/>.                            //

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

import java.util.ArrayList;

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

 * Create a 3D grid composed of Cubes.

 * <p>

 * Any subset of a MxNx1 cuboid is possible.

 */

   private static final int WEST  = 1;

   private static final int EAST  = 2;

   private static final int SOUTH = 3;

   private static final float[] mNormalY = new float[4];

     {

     final int side; 

     final int row;

     final int col;

       side= s; 

       row = r;

       col = c;

       }

   private int mEdgeNum;

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

// a Block is split into two triangles along the NE-SW line iff it is in the top-right

// or bottom-left quadrant of the grid.

   private boolean isNE(int row,int col)

     {

      boolean lastBlockIsNE=false;

      boolean thisBlockIsNE;        // the block we are currently looking at is split into

                                    // two triangles along the NE-SW line (rather than NW-SE)

        if( mCols>=2 && (mCubes[row][shiftCol]%2 == 1) && (mCubes[row][shiftCol+1]%2 == 1) ) triangleShifts++;

          {

          if( mCubes[row][col]%2 == 1 )  // land

            if( thisBlockIsNE^lastBlockIsNE ) windingShifts++;

            lastBlockIsNE = thisBlockIsNE;

            frontWalls++;

            if( col==mCols-1 || mCubes[row][col+1]%2 == 0 ) frontSegments++;

        }

      int sideVertOneSlice= 2*( mSideWalls + mSideBends + mEdgeNum -1);

      int sideVert        = 2*(mSlices-1) + mSlices*sideVertOneSlice;

      int firstWinding    = (mSlices>0 && (frontVert+1)%2==1 ) ? 1:0;

      int dataL           = mSlices==0 ? frontVert : (frontVert+1) +firstWinding+ (1+sideVert+1) + (1+frontVert);

      android.util.Log.e("CUBES", "frontW="+frontWalls+" fSegments="+frontSegments+" sWalls="+mSideWalls+" sSegments="+mEdgeNum+" sideBends="+mSideBends+" dataLen="+dataL );

      }

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

/*

   private static String debug(short[] val)

     {

     for(int i=0; i<val.length; i++) ret+=(" "+val[i]); 

     return ret;

     }

*/

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

     {

     String ret="";

     boolean neg;

     int mod;

     for(int i=0; i<val.length; i++) 

        {

        if( i%stop==0 ) ret+="\n";

        mod = i%stop;

        if( mod==0 || mod==3 || mod==6 ) ret+=" (";

        v = val[i];

        if( v==-0.0f ) v=0.0f;

        neg = v<0;

        v = (v<0 ? -v:v);

        ret+=((neg? " -":" +")+v);

        if( mod==2 || mod==5 || mod==7 ) ret+=")";

     return ret;

     }

/*

   private static String debug(Edge e)

     {

     String d = "";

     switch(e.side)

       {

       case NORTH: d+="NORTH "; break;

       case SOUTH: d+="SOUTH "; break;

       case WEST : d+="WEST  "; break;

       case EAST : d+="EAST  "; break;

       }

     d+=("("+e.row+","+e.col+")");

     return d;

     }   

     mCols       =0;

     mSlices     =slices;

       mRows = desc.length()/cols;

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

       remainingVert = numVertices;

     }

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

// full grid

     mCols        =cols;

     mSlices      =slices;

     if( cols>0 && rows>0 )

       {

       for(int j=0; j<mCols; j++)

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

       markRegions();

       remainingVert = numVertices;

     }

// Mark all the 'regions' of our grid  - i.e. separate pieces of 'land' (connected blocks that will 

// be rendered) and 'water' (connected holes in between) with integers. Each connected block of land

// gets a unique odd integer, each connected block of water a unique even integer.

//

// Water on the edges of the grid is also considered connected to itself!   

//   

// This function also creates a list of 'Edges'. Each Edge is a data structure from which later on we

// later on setting up normal vectors wouldn't work.

     int i, j, numWater=1, numLand=0;

     for(i=0; i<mRows;i++) if( mCubes[      i][      0]==0 ) markRegion((short)2,      i,       0);

     for(i=0; i<mRows;i++) if( mCubes[      i][mCols-1]==0 ) markRegion((short)2,      i, mCols-1);

     for(i=0; i<mCols;i++) if( mCubes[0      ][      i]==0 ) markRegion((short)2,      0,       i);

     for(i=0; i<mCols;i++) if( mCubes[mRows-1][      i]==0 ) markRegion((short)2,mRows-1,       i);

     for(i=0; i<mRows; i++)

        for(j=0; j<mCols; j++)

           {

           if( mCubes[i][j] == 1 ) { numLand ++; markRegion( (short)(2*numLand+1),i,j); mEdges.add(new Edge(NORTH,i  ,j)); }

     // 0 1 0

     // 1 0 1

     // 0 1 0

     int initCol, initRow, initSide, lastSide;

     Edge e1,e2;

       initRow= e1.row;

       initCol= e1.col;

       initSide=e1.side;

       do

             if( e2.side==e1.side && e2.row==e1.row && e2.col==e1.col )

               {

               mEdges.remove(j);

               mEdgeNum--;

               j--;

               //android.util.Log.e("CUBES", "removing edge "+debug(e2));

               }

           }

         lastSide = e1.side;

         e1 = getNextEdge(e1);

         if( e1.side!=lastSide ) mSideBends++;

     }

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

// when calling, make sure that newVal != val

     if( row>0       && mCubes[row-1][col  ]==val ) markRegion(newVal, row-1, col  );

     if( row<mRows-1 && mCubes[row+1][col  ]==val ) markRegion(newVal, row+1, col  );

     if( col>0       && mCubes[row  ][col-1]==val ) markRegion(newVal, row  , col-1);

     if( col<mCols-1 && mCubes[row  ][col+1]==val ) markRegion(newVal, row  , col+1);

     }

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

     int td,lr; 

     int w  = (col>0                     ) ? (mCubes[row  ][col-1]%2) : 0;

     int n  = (               row>0      ) ? (mCubes[row-1][col  ]%2) : 0;

     int c  =                                (mCubes[row  ][col  ]%2);

     int sw = (col>0       && row<mRows-1) ? (mCubes[row+1][col-1]%2) : 0;

     int ne = (col<mCols-1 && row>0      ) ? (mCubes[row-1][col+1]%2) : 0;

     int e  = (col<mCols-1               ) ? (mCubes[row  ][col+1]%2) : 0;

     int se = (col<mCols-1 && row<mRows-1) ? (mCubes[row+1][col+1]%2) : 0;

     if(front)

       {

       mNormalZ[0] = 1.0f;

       mNormalZ[1] = 1.0f;

       mNormalZ[2] = 1.0f;

       mNormalZ[3] = 1.0f;

       }

     else

       {

       mNormalZ[0] =-1.0f;

       mNormalZ[1] =-1.0f;

       mNormalZ[2] =-1.0f;

       mNormalZ[3] =-1.0f;

       }

     lr = c+n-w-nw;

     if( td<0 ) td=-1;

     if( td>0 ) td= 1;

     if( lr<0 ) lr=-1;

     if( lr>0 ) lr= 1;

     mNormalX[0] = lr*R;

     mNormalY[0] = td*R;

     td = w+c-sw-s;

     lr = c+s-w-sw;

     if( td<0 ) td=-1;

     if( td>0 ) td= 1;

     if( lr<0 ) lr=-1;

     if( lr>0 ) lr= 1;

     mNormalX[1] = lr*R;

     mNormalY[1] = td*R;

     td = n+ne-c-e;

     lr = e+ne-c-n;

     if( td<0 ) td=-1;

     if( td>0 ) td= 1;

     if( lr<0 ) lr=-1;

     if( lr>0 ) lr= 1;

     mNormalX[2] = lr*R;

     mNormalY[2] = td*R;

     td = c+e-s-se;

     lr = e+se-c-s;

     if( td<0 ) td=-1;

     if( td>0 ) td= 1;

     if( lr<0 ) lr=-1;

     if( lr>0 ) lr= 1;

     mNormalX[3] = lr*R;

     mNormalY[3] = td*R;

     /*

     android.util.Log.d("CUBES", mNormalX[0]+" "+mNormalY[0]);

     android.util.Log.d("CUBES", mNormalX[1]+" "+mNormalY[1]);

     android.util.Log.d("CUBES", mNormalX[2]+" "+mNormalY[2]);

     android.util.Log.d("CUBES", mNormalX[3]+" "+mNormalY[3]);

     }

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

     boolean lastBlockIsNE = false;

     boolean currentBlockIsNE;

       last =0;

           {

           if( !seenLand && !front && ((vertex%2==1)^currentBlockIsNE) )

             {

             //android.util.Log.d("CUBES","repeating winding2 vertex");

               {

               vertex= addFrontVertex( vertex, 0, vectZ, col, row, attribs);

               if( seenLand  && (last != current) ) vertex = repeatLast(vertex,attribs);

               if( !lastBlockIsNE || (!front && !seenLand) ) vertex = repeatLast(vertex,attribs);

               vertex= addFrontVertex( vertex, 1, vectZ, col, row+1, attribs);

             vertex= addFrontVertex( vertex, 3, vectZ, col+1, row+1, attribs);

           else

             {

             if( (last!=current) || lastBlockIsNE )

               {

               vertex= addFrontVertex( vertex, 1, vectZ, col, row+1, attribs);

               if( seenLand  && (last != current) ) vertex = repeatLast(vertex,attribs);

               if( lastBlockIsNE || (!front && !seenLand) ) vertex = repeatLast(vertex,attribs);

               vertex= addFrontVertex( vertex, 0, vectZ, col, row, attribs);

             vertex= addFrontVertex( vertex, 2, vectZ, col+1, row  , attribs);

           seenLand = true;

           lastBlockIsNE = currentBlockIsNE;

         last = current;

         }

       }

     return vertex;

     }

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

       {

       attribs[8*vertex+1] = attribs[8*vertex-7];

       attribs[8*vertex+2] = attribs[8*vertex-6];

       attribs[8*vertex+3] = attribs[8*vertex-5];

       attribs[8*vertex+4] = attribs[8*vertex-4];

       attribs[8*vertex+5] = attribs[8*vertex-3];

       attribs[8*vertex+6] = attribs[8*vertex-2];

       attribs[8*vertex+7] = attribs[8*vertex-1];

       vertex++;     

       }

     return vertex;

     }

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

     return vertex;

     }

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

     int col, row, side;

       {

       prev = new Edge(WEST,curr.row,curr.col);

       }

       {                    // going in opposite direction and we need to start from a bend.

       curr = new Edge(EAST,curr.row+1,curr.col-1);

       }

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

       row = curr.row;

       side= curr.side;

       next = getNextEdge(curr);

       do

           {

           addSideVertex(curr,true,i  ,prev.side,vertex++,attribs);

         addSideVertex(curr,false,i  ,next.side,vertex++,attribs);

         curr = next;

         next = getNextEdge(curr);

         }

       while( curr.col!=col || curr.row!=row || curr.side!=side );

       }

     }

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

     int col = curr.col;

     int row = curr.row;

     //android.util.Log.e("CUBES", "row="+row+" col="+col+" mRows="+mRows+" mCols="+mCols);

     switch(curr.side) 

       {

       case NORTH: if( col==mCols-1 ) 

                     return new Edge(EAST,row,col);

                   if( row>0 && mCubes[row-1][col+1]==mCubes[row][col] )

                     return new Edge(WEST,row-1,col+1);

                   if( mCubes[row][col+1]==mCubes[row][col] )

                     return new Edge(NORTH,row,col+1);

                   else  

                     return new Edge(EAST,row,col);

       case SOUTH: if( col==0 ) 

                     return new Edge(WEST,row,col);

                   if( (row<mRows-1) && mCubes[row+1][col-1]==mCubes[row][col] )

                     return new Edge(EAST,row+1,col-1); 

                   if( mCubes[row][col-1]==mCubes[row][col] )

                     return new Edge(SOUTH,row,col-1);

                   else

                     return new Edge(WEST,row,col); 

       case EAST : if( row==mRows-1 ) 

                     return new Edge(SOUTH,row,col);

                   if( (col<mCols-1) && mCubes[row+1][col+1]==mCubes[row][col] )

                     return new Edge(NORTH,row+1,col+1);

                   if( mCubes[row+1][col]==mCubes[row][col] )

                     return new Edge(EAST,row+1,col);

                   else 

                     return new Edge(SOUTH,row,col);

                   if( col>0 && mCubes[row-1][col-1]==mCubes[row][col] )

                     return new Edge(SOUTH,row-1,col-1);

                   if( mCubes[row-1][col]==mCubes[row][col] )

                     return new Edge(WEST,row-1,col);

                   else