-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathRPGMap.java
More file actions
325 lines (284 loc) · 12.3 KB
/
RPGMap.java
File metadata and controls
325 lines (284 loc) · 12.3 KB
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
import simplevoronoi.*;
import pcg.Pcg32;
import java.util.List;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Collections;
import java.util.Comparator;
import java.util.Arrays;
import java.lang.Math;
import javafx.geometry.Point2D;
public class RPGMap {
private double width;
private double height;
public List<Tile> tiles;
public RPGMap(int numTiles, double width, double height) {
this.width = width;
this.height = height;
generateTiles(numTiles);
smoothPointDistribution(15);
sortTiles();
assignBiomes();
}
private void generateTiles(int numTiles) {
double[] xVals = new double[numTiles];
double[] yVals = new double[numTiles];
Pcg32 r = new Pcg32();
for (int i = 0; i < xVals.length; i++) {
xVals[i] = r.nextDouble(width);
yVals[i] = r.nextDouble(height);
}
Voronoi v = new Voronoi(0.00001f);
tiles = v.generateVoronoi(xVals, yVals, 0, width, 0, height);
orderPoints();
}
private void orderPoints() {
// Correctly order points
for (Tile t : tiles) {
t.organizePoints(width, height);
}
}
private void smoothPointDistribution(int smoothness) {
for (int i = 0; i < smoothness; i++) {
List<Double> xVals = new ArrayList<Double>();
List<Double> yVals = new ArrayList<Double>();
for (int j = 0; j < tiles.size(); j++) {
double area = 0;
double cx = 0;
double cy = 0;
List<Point2D> points = tiles.get(j).getPoints();
for (int k = 0; k < points.size()-1; k++) {
Point2D p1 = points.get(k);
Point2D p2 = points.get(k+1);
area += (p1.getX() * p2.getY() - p2.getX() * p1.getY());
cx += (p1.getX() + p2.getX()) * (p1.getX() * p2.getY() - p2.getX() * p1.getY());
cy += (p1.getY() + p2.getY()) * (p1.getX() * p2.getY() - p2.getX() * p1.getY());
}
Point2D p1 = points.get(points.size()-1);
Point2D p2 = points.get(0);
area += (p1.getX() * p2.getY() - p2.getX() * p1.getY());
cx += (p1.getX() + p2.getX()) * (p1.getX() * p2.getY() - p2.getX() * p1.getY());
cy += (p1.getY() + p2.getY()) * (p1.getX() * p2.getY() - p2.getX() * p1.getY());
area /= 2;
cx /= 6*area;
cy /= 6*area;
if (area != 0) {
xVals.add(cx);
yVals.add(cy);
}
}
double[] xValsArray = new double[xVals.size()];
for (int j = 0; j < xVals.size(); j++) {
xValsArray[j] = xVals.get(j);
}
double[] yValsArray = new double[yVals.size()];
for (int j = 0; j < xVals.size(); j++) {
yValsArray[j] = yVals.get(j);
}
Voronoi v = new Voronoi(0.00001f);
tiles = v.generateVoronoi(xValsArray, yValsArray, 0, width, 0, height);
orderPoints();
}
}
private void sortTiles() {
Collections.sort(tiles, new Comparator<Tile>() {
@Override
public final int compare(Tile t1, Tile t2) {
Site s1 = t1.getSite();
Site s2 = t2.getSite();
if (s1.getY() < s2.getY()) {
return -1;
}
if (s1.getY() > s2.getY()) {
return 1;
}
return 0;
}
});
for (int i = 0; i < tiles.size(); i++) {
tiles.get(i).getSite().setNumber(i);
}
}
private void assignBiomes() {
// seed biomes
Pcg32 r = new Pcg32();
int tundraSeeds = r.nextInt((int) Math.ceil(Math.log10(tiles.size())) + 1) + 1;
int plainsSeeds = r.nextInt((int) Math.ceil(Math.log10(tiles.size())) + 1) + 1;
int hillSeeds = r.nextInt((int) Math.ceil(Math.log10(tiles.size())) + 1) + 1;
int mountainSeeds = r.nextInt((int) Math.ceil(Math.log10(tiles.size())) + 1) + 1;
int forestSeeds = r.nextInt((int) Math.ceil(Math.log10(tiles.size())) + 1) + 1;
int desertSeeds = r.nextInt((int) Math.ceil(Math.log10(tiles.size())) + 1) + 1;
int lakeSeeds = r.nextInt((int) Math.ceil(Math.log10(tiles.size())) * 3 + 1) + 1; // more lake seeds because lake biomes are composed of single tiles
int tileCount = 0;
List<Tile> tundraTiles = new ArrayList<Tile>();
HashSet<Tile> adjacentToTundra = new HashSet<Tile>();
for (int i = 0; i < tundraSeeds; i++) {
// put tundra seeds in the top 10th of the map
int tileIndex = r.nextInt(tiles.size() / 10);
tiles.get(tileIndex).setBiome(Tile.Biome.TUNDRA);
tundraTiles.add(tiles.get(tileIndex));
tileCount++;
adjacentToTundra.addAll(tiles.get(tileIndex).getAdjacentTiles());
}
List<Tile> plainsTiles = new ArrayList<Tile>();
HashSet<Tile> adjacentToPlains = new HashSet<Tile>();
for (int i = 0; i < plainsSeeds; i++) {
// put plains seeds in the bottom 90% of map
int tileIndex = r.nextInt(tiles.size() * 9 / 10) + tiles.size() / 10;
tiles.get(tileIndex).setBiome(Tile.Biome.PLAINS);
plainsTiles.add(tiles.get(tileIndex));
tileCount++;
adjacentToPlains.addAll(tiles.get(tileIndex).getAdjacentTiles());
}
List<Tile> hillTiles = new ArrayList<Tile>();
HashSet<Tile> adjacentToHill = new HashSet<Tile>();
for (int i = 0; i < hillSeeds; i++) {
// put hill seeds in the bottom 90% of map
int tileIndex = r.nextInt(tiles.size() * 9 / 10) + tiles.size() / 10;
tiles.get(tileIndex).setBiome(Tile.Biome.HILL);
hillTiles.add(tiles.get(tileIndex));
tileCount++;
adjacentToHill.addAll(tiles.get(tileIndex).getAdjacentTiles());
}
List<Tile> mountainTiles = new ArrayList<Tile>();
HashSet<Tile> adjacentToMountain = new HashSet<Tile>();
for (int i = 0; i < mountainSeeds; i++) {
// put mountain seeds in the bottom 90% of map
int tileIndex = r.nextInt(tiles.size() * 9 / 10) + tiles.size() / 10;
tiles.get(tileIndex).setBiome(Tile.Biome.MOUNTAIN);
mountainTiles.add(tiles.get(tileIndex));
tileCount++;
adjacentToMountain.addAll(tiles.get(tileIndex).getAdjacentTiles());
}
List<Tile> forestTiles = new ArrayList<Tile>();
HashSet<Tile> adjacentToForest = new HashSet<Tile>();
for (int i = 0; i < forestSeeds; i++) {
// put forest seeds in the bottom 90% of map
int tileIndex = r.nextInt(tiles.size() * 9 / 10) + tiles.size() / 10;
tiles.get(tileIndex).setBiome(Tile.Biome.FOREST);
forestTiles.add(tiles.get(tileIndex));
tileCount++;
adjacentToForest.addAll(tiles.get(tileIndex).getAdjacentTiles());
}
List<Tile> desertTiles = new ArrayList<Tile>();
HashSet<Tile> adjacentToDesert = new HashSet<Tile>();
for (int i = 0; i < desertSeeds; i++) {
// put desert seeds in the bottom 90% of map
int tileIndex = r.nextInt(tiles.size() * 9 / 10) + tiles.size() / 10;
tiles.get(tileIndex).setBiome(Tile.Biome.DESERT);
desertTiles.add(tiles.get(tileIndex));
tileCount++;
adjacentToDesert.addAll(tiles.get(tileIndex).getAdjacentTiles());
}
List<Tile> lakeTiles = new ArrayList<Tile>();
HashSet<Tile> adjacentToLake = new HashSet<Tile>();
for (int i = 0; i < lakeSeeds; i++) {
// put lake seeds anywhere in map
int tileIndex = r.nextInt(tiles.size());
tiles.get(tileIndex).setBiome(Tile.Biome.LAKE);
lakeTiles.add(tiles.get(tileIndex));
tileCount++;
adjacentToLake.addAll(tiles.get(tileIndex).getAdjacentTiles());
}
// grow biomes
while (tileCount < tiles.size()) {
// tundra
for (int i = 0; i < 5; i++) {
Tile t = tiles.get(0);
Iterator it = adjacentToTundra.iterator();
int index = r.nextInt(adjacentToTundra.size());
for (int j = 0; j <= index; j++) {
t = (Tile) it.next();
}
if (t.getBiome() == Tile.Biome.UNASSIGNED && t.getSite().getNumber() <= tiles.size() / 10) {
adjacentToTundra.remove(t);
t.setBiome(Tile.Biome.TUNDRA);
tundraTiles.add(t);
adjacentToTundra.addAll(t.getAdjacentTiles());
tileCount++;
}
}
// plains
for (int i = 0; i < 4; i++) {
Tile t = tiles.get(0);
Iterator it = adjacentToPlains.iterator();
int index = r.nextInt(adjacentToPlains.size());
for (int j = 0; j <= index; j++) {
t = (Tile) it.next();
}
if (t.getBiome() == Tile.Biome.UNASSIGNED) {
adjacentToPlains.remove(t);
t.setBiome(Tile.Biome.PLAINS);
plainsTiles.add(t);
adjacentToPlains.addAll(t.getAdjacentTiles());
tileCount++;
}
}
// hill
for (int i = 0; i < 1; i++) {
Tile t = tiles.get(0);
Iterator it = adjacentToHill.iterator();
int index = r.nextInt(adjacentToHill.size());
for (int j = 0; j <= index; j++) {
t = (Tile) it.next();
}
if (t.getBiome() == Tile.Biome.UNASSIGNED) {
adjacentToHill.remove(t);
t.setBiome(Tile.Biome.HILL);
hillTiles.add(t);
adjacentToHill.addAll(t.getAdjacentTiles());
tileCount++;
}
}
// mountain
for (int i = 0; i < 1; i++) {
Tile t = tiles.get(0);
Iterator it = adjacentToMountain.iterator();
int index = r.nextInt(adjacentToMountain.size());
for (int j = 0; j <= index; j++) {
t = (Tile) it.next();
}
if (t.getBiome() == Tile.Biome.UNASSIGNED) {
adjacentToMountain.remove(t);
t.setBiome(Tile.Biome.MOUNTAIN);
mountainTiles.add(t);
adjacentToMountain.addAll(t.getAdjacentTiles());
tileCount++;
}
}
// forest
for (int i = 0; i < 3; i++) {
Tile t = tiles.get(0);
Iterator it = adjacentToForest.iterator();
int index = r.nextInt(adjacentToForest.size());
for (int j = 0; j <= index; j++) {
t = (Tile) it.next();
}
if (t.getBiome() == Tile.Biome.UNASSIGNED) {
adjacentToForest.remove(t);
t.setBiome(Tile.Biome.FOREST);
forestTiles.add(t);
adjacentToForest.addAll(t.getAdjacentTiles());
tileCount++;
}
}
// desert
for (int i = 0; i < 4; i++) {
Tile t = tiles.get(0);
Iterator it = adjacentToDesert.iterator();
int index = r.nextInt(adjacentToDesert.size());
for (int j = 0; j <= index; j++) {
t = (Tile) it.next();
}
if (t.getBiome() == Tile.Biome.UNASSIGNED) {
adjacentToDesert.remove(t);
t.setBiome(Tile.Biome.DESERT);
desertTiles.add(t);
adjacentToDesert.addAll(t.getAdjacentTiles());
tileCount++;
}
}
}
}
}