Project

General

Profile

Download (14.8 KB) Statistics
| Branch: | Tag: | Revision:

magiccube / src / main / java / org / distorted / objects / TwistyKilominx.java @ 7764a67a

1
///////////////////////////////////////////////////////////////////////////////////////////////////
2
// Copyright 2020 Leszek Koltunski                                                               //
3
//                                                                                               //
4
// This file is part of Magic Cube.                                                              //
5
//                                                                                               //
6
// Magic Cube is free software: you can redistribute it and/or modify                            //
7
// it under the terms of the GNU General Public License as published by                          //
8
// the Free Software Foundation, either version 2 of the License, or                             //
9
// (at your option) any later version.                                                           //
10
//                                                                                               //
11
// Magic Cube is distributed in the hope that it will be useful,                                 //
12
// but WITHOUT ANY WARRANTY; without even the implied warranty of                                //
13
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the                                 //
14
// GNU General Public License for more details.                                                  //
15
//                                                                                               //
16
// You should have received a copy of the GNU General Public License                             //
17
// along with Magic Cube.  If not, see <http://www.gnu.org/licenses/>.                           //
18
///////////////////////////////////////////////////////////////////////////////////////////////////
19

    
20
package org.distorted.objects;
21

    
22
import android.content.res.Resources;
23
import android.graphics.Canvas;
24
import android.graphics.Paint;
25

    
26
import org.distorted.library.effect.MatrixEffectQuaternion;
27
import org.distorted.library.main.DistortedEffects;
28
import org.distorted.library.main.DistortedTexture;
29
import org.distorted.library.mesh.MeshBase;
30
import org.distorted.library.mesh.MeshSquare;
31
import org.distorted.library.type.Static3D;
32
import org.distorted.library.type.Static4D;
33
import org.distorted.main.R;
34
import org.distorted.main.RubikSurfaceView;
35

    
36
import static org.distorted.objects.FactoryCubit.COS18;
37
import static org.distorted.objects.FactoryCubit.COS54;
38
import static org.distorted.objects.FactoryCubit.SIN18;
39

    
40
///////////////////////////////////////////////////////////////////////////////////////////////////
41

    
42
public class TwistyKilominx extends TwistyMinx
43
{
44
  private static MeshBase[] mCenterMeshes, mCornerMeshes;
45
  private static MeshBase[][] mEdgeMeshes;
46

    
47
  private static final int mNumCornerEdgeVariants;
48

    
49
  static
50
    {
51
    int[] sizes = ObjectList.KILO.getSizes();
52
    int variants = sizes.length;
53
    mNumCornerEdgeVariants = sizes[0]==3 ? variants-1 : variants;
54
    }
55

    
56
///////////////////////////////////////////////////////////////////////////////////////////////////
57

    
58
  TwistyKilominx(int size, Static4D quat, DistortedTexture texture, MeshSquare mesh,
59
                 DistortedEffects effects, int[][] moves, Resources res, int scrWidth)
60
    {
61
    super(size, size, quat, texture, mesh, effects, moves, ObjectList.KILO, res, scrWidth);
62
    }
63

    
64
///////////////////////////////////////////////////////////////////////////////////////////////////
65

    
66
  private int numCubitsPerCorner(int numLayers)
67
    {
68
    return 3*((numLayers-3)/2)*((numLayers-5)/2) + (numLayers<5 ? 0:1);
69
    }
70

    
71
///////////////////////////////////////////////////////////////////////////////////////////////////
72

    
73
  private int numCubitsPerEdge(int numLayers)
74
    {
75
    return numLayers<5 ? 0 : 2*(numLayers-4);
76
    }
77

    
78
///////////////////////////////////////////////////////////////////////////////////////////////////
79

    
80
  int getNumStickerTypes(int numLayers)
81
    {
82
    return numLayers<5 ? 1 : numLayers/2 + 1;
83
    }
84

    
85
///////////////////////////////////////////////////////////////////////////////////////////////////
86

    
87
  float getScreenRatio()
88
    {
89
    return 1.00f;
90
    }
91

    
92
///////////////////////////////////////////////////////////////////////////////////////////////////
93

    
94
  float[] getCuts(int numLayers)
95
    {
96
    float[] cuts = new float[numLayers-1];
97
    float D = numLayers*MovementMinx.DIST3D;
98
    float E = 2*C1;           // 2*cos(36 deg)
99
    float X = 2*D*E/(1+2*E);  // height of the 'upper' part of a dodecahedron, i.e. put it on a table,
100
                              // its height is then D*2*DIST3D, it has one 'lower' part of height X, one
101
                              // 'middle' part of height Y and one upper part of height X again.
102
                              // It's edge length = numLayers/3.0f.
103
    int num = (numLayers-1)/2;
104
    float G = X*0.5f/num;     // height of one Layer
105

    
106
    for(int i=0; i<num; i++)
107
      {
108
      cuts[        i] = -D + (i+0.5f)*G;
109
      cuts[2*num-1-i] = -cuts[i];
110
      }
111

    
112
    return cuts;
113
    }
114

    
115
///////////////////////////////////////////////////////////////////////////////////////////////////
116
// Fill out mCurrCorner{X,Y,Z} by applying appropriate Quat to mBasicCorner{X,Y,Z}
117
// Appropriate one: QUATS[QUAT_INDICES[corner]].
118

    
119
  private void computeBasicCornerVectors(int corner)
120
    {
121
    Static4D quat = QUATS[QUAT_CORNER_INDICES[corner]];
122

    
123
    mCurrCornerV[0] = RubikSurfaceView.rotateVectorByQuat(mBasicCornerV[0],quat);
124
    mCurrCornerV[1] = RubikSurfaceView.rotateVectorByQuat(mBasicCornerV[1],quat);
125
    mCurrCornerV[2] = RubikSurfaceView.rotateVectorByQuat(mBasicCornerV[2],quat);
126
    }
127

    
128
///////////////////////////////////////////////////////////////////////////////////////////////////
129

    
130
  private float[] computeCorner(int numCubitsPerCorner, int numLayers, int corner, int part)
131
    {
132
    float D = numLayers/3.0f;
133
    float[] corn = CORNERS[corner];
134

    
135
    if( part==0 )
136
      {
137
      return new float[] { corn[0]*D, corn[1]*D, corn[2]*D };
138
      }
139
    else
140
      {
141
      float E = D/(0.5f*(numLayers-1));   // ?? maybe 0.5*
142
      int N = (numCubitsPerCorner-1)/3;
143
      int block = (part-1) % N;
144
      int index = (part-1) / N;
145
      Static4D pri = mCurrCornerV[index];
146
      Static4D sec = mCurrCornerV[(index+2)%3];
147

    
148
      int layers= (numLayers-5)/2;
149
      int multP = (block % layers) + 1;
150
      int multS = (block / layers);
151

    
152
      return new float[] {
153
                          corn[0]*D + (pri.get0()*multP + sec.get0()*multS)*E,
154
                          corn[1]*D + (pri.get1()*multP + sec.get1()*multS)*E,
155
                          corn[2]*D + (pri.get2()*multP + sec.get2()*multS)*E
156
                         };
157
      }
158
    }
159

    
160
///////////////////////////////////////////////////////////////////////////////////////////////////
161

    
162
  private float[] computeCenter(int numLayers, int center, int part)
163
    {
164
    int corner = mCenterMap[center][part];
165
    float[] cent = mCenterCoords[center];
166
    float[] corn = CORNERS[corner];
167
    float D = numLayers/3.0f;
168
    float F = 1.0f - (2.0f*numLayers-6.0f)/(numLayers-1)*COS54*COS54;
169

    
170
    return new float[]
171
      {
172
        D * ( cent[0] + (corn[0]-cent[0])*F),
173
        D * ( cent[1] + (corn[1]-cent[1])*F),
174
        D * ( cent[2] + (corn[2]-cent[2])*F)
175
      };
176
    }
177

    
178
///////////////////////////////////////////////////////////////////////////////////////////////////
179

    
180
  private int computeEdgeType(int cubit, int numCubitsPerCorner, int numCubitsPerEdge)
181
    {
182
    int part = (cubit - NUM_CORNERS*numCubitsPerCorner) % numCubitsPerEdge;
183
    return part - 2*(part/4);
184
    }
185

    
186
///////////////////////////////////////////////////////////////////////////////////////////////////
187

    
188
  private float[] computeEdge(int numLayers, int edge, int part)
189
    {
190
    float D = numLayers/3.0f;
191

    
192
    float[] c1 = CORNERS[ mEdgeMap[edge][0] ];
193
    float[] c2 = CORNERS[ mEdgeMap[edge][1] ];
194
    float x = D * (c1[0]+c2[0]) / 2;
195
    float y = D * (c1[1]+c2[1]) / 2;
196
    float z = D * (c1[2]+c2[2]) / 2;
197

    
198
    part /= 2;
199

    
200
    if( part==0 )
201
      {
202
      return new float[] { x, y, z };
203
      }
204
    else
205
      {
206
      int mult = (part+1)/2;
207
      int dir  = (part+1)%2;
208
      float[] center = mCenterCoords[ mEdgeMap[edge][dir+2] ];
209

    
210
      float vX = D*center[0] - x;
211
      float vY = D*center[1] - y;
212
      float vZ = D*center[2] - z;
213

    
214
      float A = mult*D*COS18/(numLayers-1);
215
      A /= (float)Math.sqrt(vX*vX+vY*vY+vZ*vZ);
216

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

    
221
///////////////////////////////////////////////////////////////////////////////////////////////////
222

    
223
  float[][] getCubitPositions(int numLayers)
224
    {
225
    if( numLayers<5 ) return CORNERS;
226

    
227
    int numCubitsPerCorner = numCubitsPerCorner(numLayers);
228
    int numCubitsPerEdge   = numCubitsPerEdge(numLayers);
229
    int numCubitsPerCenter = 5;
230
    int numCubits = NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge + NUM_CENTERS*numCubitsPerCenter;
231
    int index=0;
232

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

    
235
    for(int corner=0; corner<NUM_CORNERS; corner++)
236
      {
237
      computeBasicCornerVectors(corner);
238

    
239
      for(int part=0; part<numCubitsPerCorner; part++, index++)
240
        {
241
        CENTERS[index] = computeCorner(numCubitsPerCorner,numLayers,corner,part);
242
        }
243
      }
244

    
245
    for(int edge=0; edge<NUM_EDGES; edge++)
246
      {
247
      for(int part=0; part<numCubitsPerEdge; part++, index++)
248
        {
249
        CENTERS[index] = computeEdge(numLayers, edge, part );
250
        }
251
      }
252

    
253
    for(int center=0; center<NUM_CENTERS; center++, index++)
254
      {
255
      for(int part=0; part<numCubitsPerCenter; part++, index++)
256
        {
257
        CENTERS[index] = computeCenter(numLayers,center, part);
258
        }
259
      }
260

    
261
    return CENTERS;
262
    }
263

    
264
///////////////////////////////////////////////////////////////////////////////////////////////////
265

    
266
  private int getQuat(int cubit, int numCubitsPerCorner, int numCubitsPerEdge)
267
    {
268
    if( cubit < NUM_CORNERS*numCubitsPerCorner )
269
      {
270
      int corner = cubit/numCubitsPerCorner;
271
      return QUAT_CORNER_INDICES[corner];
272
      }
273

    
274
    if( cubit < NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge )
275
      {
276
      int edge = (cubit-NUM_CORNERS*numCubitsPerCorner)/numCubitsPerEdge;
277
      return QUAT_EDGE_INDICES[edge];
278
      }
279

    
280
    if( numCubitsPerCorner==0 )
281
      {
282
      return QUAT_CORNER_INDICES[cubit];
283
      }
284
    else
285
      {
286
      cubit -= (NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge);
287
      int numCubitsPerCenter = 5;
288
      int face = cubit/numCubitsPerCenter;
289
      int index= cubit%numCubitsPerCenter;
290
      int corner=mCenterMap[face][index];
291

    
292
      return QUAT_CORNER_INDICES[corner];
293
      }
294
    }
295

    
296
///////////////////////////////////////////////////////////////////////////////////////////////////
297

    
298
  MeshBase createCubitMesh(int cubit, int numLayers)
299
    {
300
    int numCubitsPerCorner = numCubitsPerCorner(numLayers);
301
    int numCubitsPerEdge   = numCubitsPerEdge(numLayers);
302
    int[] sizes = ObjectList.KILO.getSizes();
303
    int variants = sizes.length;
304
    int highestSize = sizes[variants-1];
305
    int lowestSize = sizes[0];
306
    int indexCornerEdge = (numLayers-lowestSize)/2 - (lowestSize==3 ? 1:0);
307
    MeshBase mesh;
308

    
309
    if( mNumCornerEdgeVariants>0 )
310
      {
311
      if( mCornerMeshes==null ) mCornerMeshes = new MeshBase[mNumCornerEdgeVariants];
312
      if( mEdgeMeshes  ==null ) mEdgeMeshes   = new MeshBase[mNumCornerEdgeVariants][(highestSize-3)/2];
313
      }
314

    
315
    if( mCenterMeshes==null ) mCenterMeshes = new MeshBase[variants];
316

    
317
    if( cubit < NUM_CORNERS*numCubitsPerCorner )
318
      {
319
      if( mCornerMeshes[indexCornerEdge]==null )
320
        {
321
        mCornerMeshes[indexCornerEdge] = FactoryCubit.getInstance().createMinxCornerMesh(ObjectList.KILO,numLayers);
322
        }
323
      mesh = mCornerMeshes[indexCornerEdge].copy(true);
324
      }
325
    else if( cubit<NUM_CORNERS*numCubitsPerCorner + NUM_EDGES*numCubitsPerEdge )
326
      {
327
      int type = computeEdgeType(cubit,numCubitsPerCorner,numCubitsPerEdge);  // left-top, right-top, left-second, right-second, left-third...
328

    
329
      if( mEdgeMeshes[indexCornerEdge][type]==null )
330
        {
331
        float tmp   = (numLayers/3.0f)/(numLayers-1);
332
        float height= tmp*COS18;
333
        float width = tmp + type*height*SIN18/COS18;
334

    
335
        mEdgeMeshes[indexCornerEdge][type] = FactoryCubit.getInstance().createKilominxEdgeMesh(numLayers,width,height);
336
        }
337

    
338
      mesh = mEdgeMeshes[indexCornerEdge][type].copy(true);
339
      }
340
    else
341
      {
342
      int indexCenter = (numLayers-3)/2;
343

    
344
      if( mCenterMeshes[indexCenter]==null )
345
        {
346
        float width = (1+0.5f*(numLayers-3)*SIN18)*(numLayers/3.0f)/(numLayers-1);
347
        mCenterMeshes[indexCenter] = FactoryCubit.getInstance().createKilominxCenterMesh(width);
348
        }
349

    
350
      mesh = mCenterMeshes[indexCenter].copy(true);
351
      }
352

    
353
    Static4D q = QUATS[getQuat(cubit,numCubitsPerCorner,numCubitsPerEdge)];
354
    MatrixEffectQuaternion quat = new MatrixEffectQuaternion( q, new Static3D(0,0,0) );
355
    mesh.apply(quat,0xffffffff,0);
356

    
357
    return mesh;
358
    }
359

    
360
///////////////////////////////////////////////////////////////////////////////////////////////////
361
// TODO
362

    
363
  int getFaceColor(int cubit, int cubitface, int numLayers)
364
    {
365
    return cubitface>=0 && cubitface<3 ? mCornerFaceMap[cubit][cubitface] : NUM_TEXTURES*NUM_FACES;
366
    }
367

    
368
///////////////////////////////////////////////////////////////////////////////////////////////////
369
// TODO
370

    
371
  void createFaceTexture(Canvas canvas, Paint paint, int face, int left, int top)
372
    {
373
    float S = 0.07f;
374
    float R = 0.09f;
375

    
376
    float A = 0.86f;
377
    float X1= (SQ5+1)/8;
378
    float Y1= (float)(Math.sqrt(2+0.4f*SQ5)/4);
379
    float Y2= Y1 - (float)(Math.sqrt(10-2*SQ5)/8);
380

    
381
    float[] vertices = { -X1, Y2, 0, -A*Y1, X1, Y2, 0, Y1 };
382

    
383
    FactorySticker factory = FactorySticker.getInstance();
384
    factory.drawRoundedPolygon(canvas, paint, left, top, vertices, S, FACE_COLORS[face], R);
385

    
386
    float MID = TEXTURE_HEIGHT*0.5f;
387
    float WID = TEXTURE_HEIGHT*0.1f;
388
    float HEI = TEXTURE_HEIGHT*(0.47f+Y1);
389
    canvas.drawLine(left+MID-WID,top+HEI,left+MID+WID,top+HEI,paint);
390
    }
391

    
392
///////////////////////////////////////////////////////////////////////////////////////////////////
393
// PUBLIC API
394

    
395
  public boolean isSolved()
396
    {
397
    int index = CUBITS[0].mQuatIndex;
398

    
399
    for(int i=1; i<NUM_CUBITS; i++)
400
      {
401
      if( thereIsVisibleDifference(CUBITS[i], index) ) return false;
402
      }
403

    
404
    return true;
405
    }
406

    
407
///////////////////////////////////////////////////////////////////////////////////////////////////
408

    
409
  public int getObjectName(int numLayers)
410
    {
411
    if( numLayers==3 ) return R.string.minx2;
412
    if( numLayers==5 ) return R.string.minx4;
413

    
414
    return 0;
415
    }
416

    
417
///////////////////////////////////////////////////////////////////////////////////////////////////
418

    
419
  public int getInventor(int numLayers)
420
    {
421
    if( numLayers==3 ) return R.string.minx2_inventor;
422
    if( numLayers==5 ) return R.string.minx4_inventor;
423

    
424
    return 0;
425
    }
426

    
427
///////////////////////////////////////////////////////////////////////////////////////////////////
428

    
429
  public int getComplexity(int numLayers)
430
    {
431
    return 3;
432
    }
433
}
(28-28/35)