|
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 static org.distorted.objects.TwistyMinx.C2;
|
|
23
|
import static org.distorted.objects.TwistyMinx.COS54;
|
|
24
|
import static org.distorted.objects.TwistyMinx.LEN;
|
|
25
|
import static org.distorted.objects.TwistyMinx.SIN54;
|
|
26
|
import static org.distorted.objects.TwistyObject.SQ5;
|
|
27
|
|
|
28
|
import org.distorted.library.type.Static3D;
|
|
29
|
|
|
30
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
31
|
// Dodecahedral objects: map the 2D swipes of user's fingers to 3D rotations
|
|
32
|
|
|
33
|
abstract class Movement12 extends Movement
|
|
34
|
{
|
|
35
|
static final float DIST3D = (float)Math.sqrt(0.625f+0.275f*SQ5);
|
|
36
|
static final float DIST2D = (SIN54/COS54)/2;
|
|
37
|
|
|
38
|
static final Static3D[] FACE_AXIS = new Static3D[]
|
|
39
|
{
|
|
40
|
new Static3D( C2/LEN, SIN54/LEN, 0 ),
|
|
41
|
new Static3D( C2/LEN,-SIN54/LEN, 0 ),
|
|
42
|
new Static3D( -C2/LEN, SIN54/LEN, 0 ),
|
|
43
|
new Static3D( -C2/LEN,-SIN54/LEN, 0 ),
|
|
44
|
new Static3D( 0 , C2/LEN, SIN54/LEN ),
|
|
45
|
new Static3D( 0 , C2/LEN,-SIN54/LEN ),
|
|
46
|
new Static3D( 0 , -C2/LEN, SIN54/LEN ),
|
|
47
|
new Static3D( 0 , -C2/LEN,-SIN54/LEN ),
|
|
48
|
new Static3D( SIN54/LEN, 0 , C2/LEN ),
|
|
49
|
new Static3D( SIN54/LEN, 0 , -C2/LEN ),
|
|
50
|
new Static3D(-SIN54/LEN, 0 , C2/LEN ),
|
|
51
|
new Static3D(-SIN54/LEN, 0 , -C2/LEN )
|
|
52
|
};
|
|
53
|
|
|
54
|
private final float[][] mTouchBorders;
|
|
55
|
|
|
56
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
57
|
|
|
58
|
Movement12(Static3D[] rotAxis,float[][] cuts, boolean[][] rotatable, int numLayers)
|
|
59
|
{
|
|
60
|
super(rotAxis, FACE_AXIS, DIST3D, DIST2D);
|
|
61
|
float scale = (DIST2D*(1.5f)/(2*DIST3D))/numLayers; // SQ5/2 is 1/cos(dihedral-90)
|
|
62
|
mTouchBorders = computeBorders(scale,cuts,rotatable);
|
|
63
|
}
|
|
64
|
|
|
65
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
66
|
|
|
67
|
int computeRowFromOffset(int face, int axisIndex, int numLayers, float offset)
|
|
68
|
{
|
|
69
|
float[] borders = mTouchBorders[axisIndex];
|
|
70
|
int len = borders.length;
|
|
71
|
|
|
72
|
for(int i=0; i<len; i++)
|
|
73
|
{
|
|
74
|
if( offset<borders[i] ) return i;
|
|
75
|
}
|
|
76
|
|
|
77
|
return len;
|
|
78
|
}
|
|
79
|
|
|
80
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
81
|
|
|
82
|
public float returnRotationFactor(int numLayers, int row)
|
|
83
|
{
|
|
84
|
return 1.0f;
|
|
85
|
}
|
|
86
|
|
|
87
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
88
|
// return angle (in radians) that the line connecting the center C of the pentagonal face and the
|
|
89
|
// first vertex of the pentagon makes with a vertical line coming upwards from the center C.
|
|
90
|
|
|
91
|
private float returnAngle(int face)
|
|
92
|
{
|
|
93
|
switch(face)
|
|
94
|
{
|
|
95
|
case 0:
|
|
96
|
case 2:
|
|
97
|
case 6:
|
|
98
|
case 7: return 0.0f;
|
|
99
|
case 1:
|
|
100
|
case 3:
|
|
101
|
case 4:
|
|
102
|
case 5: return (float)(36*Math.PI/180);
|
|
103
|
case 9:
|
|
104
|
case 10: return (float)(54*Math.PI/180);
|
|
105
|
case 8:
|
|
106
|
case 11: return (float)(18*Math.PI/180);
|
|
107
|
}
|
|
108
|
|
|
109
|
return 0.0f;
|
|
110
|
}
|
|
111
|
|
|
112
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
113
|
// The pair (distance,angle) defines a point P in R^2 in polar coordinate system. Let V be the vector
|
|
114
|
// from the center of the coordinate system to P.
|
|
115
|
// Let P' be the point defined by polar (distance,angle+PI/2). Let Lh be the half-line starting at
|
|
116
|
// P' and going in the direction of V.
|
|
117
|
// Return true iff point 'point' lies on the left of Lh, i.e. when we rotate (using the center of
|
|
118
|
// the coordinate system as the center of rotation) 'point' and Lh in such a way that Lh points
|
|
119
|
// directly upwards, is 'point' on the left or the right of it?
|
|
120
|
|
|
121
|
private boolean isOnTheLeft(float[] point, float distance, float angle)
|
|
122
|
{
|
|
123
|
float sin = (float)Math.sin(angle);
|
|
124
|
float cos = (float)Math.cos(angle);
|
|
125
|
|
|
126
|
float vx = point[0] + sin*distance;
|
|
127
|
float vy = point[1] - cos*distance;
|
|
128
|
|
|
129
|
return vx*sin < vy*cos;
|
|
130
|
}
|
|
131
|
|
|
132
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
133
|
// Return 1,2,3,4,5 - the vertex of the pentagon to which point 'point' is the closest, if the
|
|
134
|
// 'point' is inside the pentagon - or 0 otherwise.
|
|
135
|
// The 'first' vertex is the one we meet the first when we rotate clockwise starting from 12:00.
|
|
136
|
// This vertex makes angle 'returnAngle()' with the line coming out upwards from the center of the
|
|
137
|
// pentagon.
|
|
138
|
// Distance from the center to a vertex of the pentagon = 1/(6*COS54)
|
|
139
|
|
|
140
|
int returnPartOfThePentagon(float[] point, int face)
|
|
141
|
{
|
|
142
|
float angle = returnAngle(face);
|
|
143
|
float A = (float)(Math.PI/5);
|
|
144
|
|
|
145
|
for(int i=0; i<5; i++)
|
|
146
|
{
|
|
147
|
if( isOnTheLeft(point, DIST2D, (9-2*i)*A-angle) ) return 0;
|
|
148
|
}
|
|
149
|
|
|
150
|
if( isOnTheLeft(point, 0, 2.5f*A-angle) )
|
|
151
|
{
|
|
152
|
if( isOnTheLeft(point, 0, 3.5f*A-angle) )
|
|
153
|
{
|
|
154
|
return isOnTheLeft(point, 0, 5.5f*A-angle) ? 4 : 5;
|
|
155
|
}
|
|
156
|
else return 1;
|
|
157
|
}
|
|
158
|
else
|
|
159
|
{
|
|
160
|
if( isOnTheLeft(point, 0, 4.5f*A-angle) )
|
|
161
|
{
|
|
162
|
return 3;
|
|
163
|
}
|
|
164
|
else
|
|
165
|
{
|
|
166
|
return isOnTheLeft(point, 0, 6.5f*A-angle) ? 2 : 1;
|
|
167
|
}
|
|
168
|
}
|
|
169
|
}
|
|
170
|
|
|
171
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
172
|
|
|
173
|
boolean isInsideFace(int face, float[] p)
|
|
174
|
{
|
|
175
|
return returnPartOfThePentagon(p,face) > 0;
|
|
176
|
}
|
|
177
|
}
|