-
Notifications
You must be signed in to change notification settings - Fork 0
/
PointGenerator.java
402 lines (273 loc) · 13.4 KB
/
PointGenerator.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
package SwansonLibrary;
import android.graphics.Path;
import android.graphics.Point;
import android.graphics.Rect;
import android.util.Log;
import android.widget.TextView;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Random;
/**
* Created by Brandon on 4/30/14.
*/
public class PointGenerator {
private final Rect mBounds;
private class RadianRange{
public double begining;
public double end;
private RadianRange(double begining, double end) {
this.begining = begining;
this.end = end;
}
private double range(){
return end-begining;
}
}
private Random randomGen = new Random();
///DATA STRUCTURE
//private Point mLinePoints[];
private int mDiagonal;
private int mMinLength;
private static final int UNRESTRICTED=-1;
private int mMaxLength=UNRESTRICTED;
private float mMaxAngle=UNRESTRICTED; //as a percent of 180 representing the restricted radian in the same direction
private ViewTools.Line BorderLines[];
private float mMinAngle; //as a percent of 180, .25=45degree = 90degree total restriction
public PointGenerator(int mMinLength, Rect bounds, float minAngle) {
this.mDiagonal = (int) ViewTools.getHypotenuse(bounds.width(),bounds.height());
this.mMinLength = mMinLength;
this.mMinAngle=minAngle;
mBounds = bounds;
BorderLines = ViewTools.rectToLines(bounds);
}
public void setmMaxLength(int maxLength){
if(maxLength>mMinLength) mMaxLength=maxLength;
}
public void setmMaxAngle(float maxAngle){mMaxAngle=maxAngle;}
public RadianExclusionMap makeMap(Point Origin, Point CurrentPoint){
return new RadianExclusionMap(Origin,CurrentPoint);
}
public class RadianExclusionMap{
private ArrayList<RadianRange> mExcludedRanges = new ArrayList<RadianRange>();
private Point mCurrentPoint;
private double mAvailableRadians = ViewTools.FULLCIRCLE;
private double mTotalExludedRadians = 0;
private RadianExclusionMap(Point Origin, Point CurrentPoint) {
mCurrentPoint=CurrentPoint;
//opposite angle exclusion
Double lastRadian = ViewTools.getArcTan2Mapped(Origin,CurrentPoint);
double beginingRad; double endRad;
beginingRad = (lastRadian + ViewTools.FULLCIRCLE - (mMinAngle*Math.PI) + Math.PI)%ViewTools.FULLCIRCLE;
endRad = (lastRadian + (mMinAngle*Math.PI) + Math.PI)%ViewTools.FULLCIRCLE;
if(beginingRad>endRad){
mExcludedRanges.add(new RadianRange(beginingRad,ViewTools.FULLCIRCLE));
beginingRad=0;
}
mExcludedRanges.add(new RadianRange(beginingRad,endRad));
//opposite angle exclusion
if(mMaxAngle!=UNRESTRICTED){
beginingRad = (lastRadian - Math.PI*mMaxAngle)%ViewTools.FULLCIRCLE;
endRad = (lastRadian + Math.PI*mMaxAngle)%ViewTools.FULLCIRCLE;
if(beginingRad>endRad){
mExcludedRanges.add(new RadianRange(beginingRad,ViewTools.FULLCIRCLE));
beginingRad=0;
}
mExcludedRanges.add(new RadianRange(beginingRad,endRad));
}
//detect proximity to walls, exclude them
if(mCurrentPoint.y-mBounds.top<mMinLength){
mExcludedRanges.add(getWallRadianRange(mBounds.top, ViewTools.RadianAngles.TOP, mCurrentPoint.y, true));
}
if(mBounds.bottom-mCurrentPoint.y<mMinLength){
mExcludedRanges.add(getWallRadianRange(mBounds.bottom, ViewTools.RadianAngles.BOTTOM,mCurrentPoint.y,true));
}
if(mCurrentPoint.x-mBounds.left<mMinLength){
mExcludedRanges.add(getWallRadianRange(mBounds.left, ViewTools.RadianAngles.LEFT,mCurrentPoint.x,false));
}
if(mBounds.right-mCurrentPoint.x<mMinLength){
mExcludedRanges.add(getWallRadianRange(mBounds.right, ViewTools.RadianAngles.RIGHT,mCurrentPoint.x,false));
}
//sort and merge
if(mExcludedRanges.size()>1){
mExcludedRanges=SortMergeImroved();
}
//calc available
for(int i=0;i<mExcludedRanges.size();i++){
mTotalExludedRadians+=mExcludedRanges.get(i).range();
mAvailableRadians-=mExcludedRanges.get(i).range();
}
}
private ArrayList<RadianRange> SortMergeImroved(){
ArrayList<RadianRange> unSortedRanges = (ArrayList<RadianRange>) mExcludedRanges.clone();
ArrayList<RadianRange> sortedRanges = new ArrayList<RadianRange>();
ArrayList<RadianRange> mergedRanges = new ArrayList<RadianRange>();
//sort
while (unSortedRanges.size()>0){
RadianRange smallestRadian=unSortedRanges.get(0);
for(int v=0;v<unSortedRanges.size();v++){
if(unSortedRanges.get(v).begining<smallestRadian.begining) {
smallestRadian=unSortedRanges.get(v);
}
}
sortedRanges.add(smallestRadian);
unSortedRanges.remove(smallestRadian);
}
//merge
for(int i=0;i<sortedRanges.size()-1;i++){
if(sortedRanges.get(i).end>sortedRanges.get(i+1).begining){
sortedRanges.get(i+1).begining=sortedRanges.get(i).begining;
}else mergedRanges.add(sortedRanges.get(i));
}
mergedRanges.add(sortedRanges.get(sortedRanges.size()-1));
return (ArrayList<RadianRange>)mergedRanges.clone();
}
private RadianRange getWallRadianRange(int walledge, double wallRadian, int point, boolean y) {
int opposite = point-walledge;
Double adjecent = Math.sqrt((mMinLength*mMinLength-opposite*opposite));
double rad;
if(y)rad=ViewTools.getArcTan2Mapped(opposite, adjecent);
else rad=ViewTools.getArcTan2Mapped(adjecent, opposite);
double wallRadStart = (rad+Math.PI)%ViewTools.FULLCIRCLE;;
double wallRadEnd = (wallRadian + (wallRadian-wallRadStart)+ ViewTools.FULLCIRCLE)%ViewTools.FULLCIRCLE;
if(wallRadEnd<wallRadStart && wallRadian!=0){
double radtemp=wallRadStart;
wallRadStart=wallRadEnd;
wallRadEnd=radtemp;
}
if(wallRadian==0){
//mAvailableRadians-=(ViewTools.FULLCIRCLE-wallRadStart);
mExcludedRanges.add(new RadianRange(wallRadStart,ViewTools.FULLCIRCLE)); //find a much better way for this!
wallRadStart=0;
}
return new RadianRange(wallRadStart,wallRadEnd);
}
public Point getPoint(){
double approvedRad=getAppropriateRad();
double approvedLength=getAppropriateLenth(approvedRad);
Point generatedPoint = ViewTools.vectorToPoint(approvedRad, approvedLength, mCurrentPoint,mBounds);
return generatedPoint;
}
private double getAppropriateRad() {
double unmappedRad = mAvailableRadians*randomGen.nextFloat();
return getMappedRad(unmappedRad);
}
private double getMappedRad(double unmappedRad){
for(int i=0;i<mExcludedRanges.size();i++){
if(unmappedRad>mExcludedRanges.get(i).begining){
unmappedRad+=mExcludedRanges.get(i).range();
}
}
return unmappedRad;
}
private double getAppropriateLenth(double approvedRad) {
//get point off frame
Point offScreenPoint=ViewTools.vectorToPoint(approvedRad, mDiagonal, mCurrentPoint);
//find intersecton
ViewTools.Line extendedLine = new ViewTools.Line(mCurrentPoint.x,mCurrentPoint.y,offScreenPoint.x,offScreenPoint.y);
ViewTools.Intersection intersections[]= new ViewTools.Intersection[4];
ArrayList<Point> borderpoints = new ArrayList<Point>();
Point borderpoint = new Point(-1,-1);
int numIntersections=0;
for(int i=0;i<4;i++){
intersections[i]=ViewTools.get_line_intersection(extendedLine,BorderLines[i]);
if(intersections[i].intersects) {
numIntersections++;
borderpoints.add(intersections[i].intersectionPoint);
}
}
if(numIntersections>1){
double greatestDistance=0;
for(int i=0;i<borderpoints.size();i++){
if(ViewTools.getDistancetoNonSQRTD(mCurrentPoint,borderpoints.get(i))>greatestDistance){
borderpoint=borderpoints.get(i);
}
}
}
else if(numIntersections==0){
Log.d("PATH", "border intersection not detected");
}
else borderpoint = borderpoints.get(0);
//use to calc distance
Double WallLength=Math.sqrt(ViewTools.getDistancetoNonSQRTD(mCurrentPoint.x, mCurrentPoint.y, borderpoint.x, borderpoint.y));
//get random length
double pointLength;
if(WallLength>=mMinLength){
if(mMaxLength==UNRESTRICTED)pointLength=randomGen.nextFloat()*(WallLength-mMinLength)+mMinLength; //for rounding error
else{
if(mMaxLength<WallLength) {
pointLength=randomGen.nextFloat()*(mMaxLength-mMinLength)+mMinLength;
}else {
pointLength=randomGen.nextFloat()*(WallLength-mMinLength)+mMinLength;
}
}
}else{
pointLength=WallLength;
}
if(pointLength==0){
Log.d("PATH", "zero length");
}
return pointLength;
}
//fordebug///
public ArrayList<Point> getAllPoints(){
ArrayList<Point> generatedPoints = new ArrayList<Point>();
for(float v = 0f;v<1;v+=.005){
double unmappedRad=mAvailableRadians*v;
double mappedRad = getMappedRad(unmappedRad);
generatedPoints.add(ViewTools.vectorToPoint(mappedRad, mMinLength, mCurrentPoint));
}
return generatedPoints;
}
public void Visualize(Path path, TextView readout){
//readout.setText(" ");
path.rewind();
for(int i=0;i<mExcludedRanges.size();i++){
RadianRange range = mExcludedRanges.get(i);
Point drawPoint = ViewTools.vectorToPoint(range.begining, mMinLength, mCurrentPoint);
path.moveTo(mCurrentPoint.x,mCurrentPoint.y);path.lineTo(drawPoint.x,drawPoint.y);
drawPoint = ViewTools.vectorToPoint(range.end, mMinLength, mCurrentPoint);
path.moveTo(mCurrentPoint.x,mCurrentPoint.y);path.lineTo(drawPoint.x,drawPoint.y);
for(double lineRadian=range.begining;lineRadian<range.end;lineRadian+=Math.PI/90){
//line from newpoint to radian vector, 1/3 min length
drawPoint=ViewTools.vectorToPoint(lineRadian, mMinLength * .6f, mCurrentPoint);
path.moveTo(mCurrentPoint.x,mCurrentPoint.y);
path.lineTo(drawPoint.x,drawPoint.y);
}
DecimalFormat oneDigit = new DecimalFormat("#.#");
readout.setText(readout.getText()+" EX"+ i + "="+
oneDigit.format(range.begining) + "-" + oneDigit.format(range.end));
}
DecimalFormat twoDigit = new DecimalFormat("#.##");
readout.setText(readout.getText()+"AVIL:" + twoDigit.format(mAvailableRadians)+
"EX:"+ twoDigit.format(mTotalExludedRadians) + " " + twoDigit.format(mTotalExludedRadians+mAvailableRadians));
if(mBounds.bottom-mCurrentPoint.y<mMinLength){
Point drawpoint = ViewTools.vectorToPoint(
ViewTools.RadianAngles.BOTTOM,
mBounds.bottom-mCurrentPoint.y, mCurrentPoint);
path.addCircle(drawpoint.x,drawpoint.y,10, Path.Direction.CCW);
//1.5 pi
}
if(mCurrentPoint.y-mBounds.top<mMinLength){
Point drawpoint = ViewTools.vectorToPoint(
ViewTools.RadianAngles.TOP,
mCurrentPoint.y-mBounds.top, mCurrentPoint);
path.addCircle(drawpoint.x,drawpoint.y,10, Path.Direction.CCW);
//half pi
}
if(mCurrentPoint.x-mBounds.left<mMinLength){
Point drawpoint = ViewTools.vectorToPoint(
ViewTools.RadianAngles.LEFT,
mCurrentPoint.x - mBounds.left, mCurrentPoint);
path.addCircle(drawpoint.x,drawpoint.y,10, Path.Direction.CCW);
//1pi
}
if(mBounds.right-mCurrentPoint.x<mMinLength){
Point drawpoint = ViewTools.vectorToPoint(
ViewTools.RadianAngles.RIGHT,
mBounds.right - mCurrentPoint.x, mCurrentPoint);
path.addCircle(drawpoint.x,drawpoint.y,10, Path.Direction.CCW);
//0pi
}
}
}
}