author | nemo |
Sat, 31 May 2014 15:04:26 -0400 | |
changeset 10250 | 887610b44848 |
parent 10226 | cb63617a0c2f |
child 10387 | cb17b79844b5 |
permissions | -rw-r--r-- |
10198 | 1 |
unit uLandGenTemplateBased; |
2 |
interface |
|
3 |
||
4 |
uses uLandTemplates; |
|
5 |
||
6 |
procedure GenTemplated(var Template: TEdgeTemplate); |
|
7 |
||
8 |
implementation |
|
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
9 |
uses uVariables, uConsts, uFloat, uLandOutline, uLandUtils, uRandom, SDLh, math; |
10198 | 10 |
|
11 |
||
12 |
procedure SetPoints(var Template: TEdgeTemplate; var pa: TPixAr; fps: PPointArray); |
|
13 |
var i: LongInt; |
|
14 |
begin |
|
15 |
with Template do |
|
16 |
begin |
|
17 |
pa.Count:= BasePointsCount; |
|
18 |
for i:= 0 to pred(pa.Count) do |
|
19 |
begin |
|
20 |
pa.ar[i].x:= BasePoints^[i].x + LongInt(GetRandom(BasePoints^[i].w)); |
|
21 |
if pa.ar[i].x <> NTPX then |
|
10199 | 22 |
pa.ar[i].x:= pa.ar[i].x + ((LAND_WIDTH - Template.TemplateWidth) div 2); |
10198 | 23 |
pa.ar[i].y:= BasePoints^[i].y + LongInt(GetRandom(BasePoints^[i].h)) + LAND_HEIGHT - LongInt(Template.TemplateHeight) |
24 |
end; |
|
25 |
||
26 |
if canMirror then |
|
27 |
if getrandom(2) = 0 then |
|
28 |
begin |
|
29 |
for i:= 0 to pred(BasePointsCount) do |
|
30 |
if pa.ar[i].x <> NTPX then |
|
31 |
pa.ar[i].x:= LAND_WIDTH - 1 - pa.ar[i].x; |
|
32 |
for i:= 0 to pred(FillPointsCount) do |
|
33 |
fps^[i].x:= LAND_WIDTH - 1 - fps^[i].x; |
|
34 |
end; |
|
35 |
||
36 |
(* Experiment in making this option more useful |
|
37 |
if ((not isNegative) and (cTemplateFilter = 4)) or |
|
38 |
(canFlip and (getrandom(2) = 0)) then |
|
39 |
begin |
|
40 |
for i:= 0 to pred(BasePointsCount) do |
|
41 |
begin |
|
42 |
pa.ar[i].y:= LAND_HEIGHT - 1 - pa.ar[i].y + (LAND_HEIGHT - TemplateHeight) * 2; |
|
43 |
if pa.ar[i].y > LAND_HEIGHT - 1 then |
|
44 |
pa.ar[i].y:= LAND_HEIGHT - 1; |
|
45 |
end; |
|
46 |
for i:= 0 to pred(FillPointsCount) do |
|
47 |
begin |
|
48 |
FillPoints^[i].y:= LAND_HEIGHT - 1 - FillPoints^[i].y + (LAND_HEIGHT - TemplateHeight) * 2; |
|
49 |
if FillPoints^[i].y > LAND_HEIGHT - 1 then |
|
50 |
FillPoints^[i].y:= LAND_HEIGHT - 1; |
|
51 |
end; |
|
52 |
end; |
|
53 |
end |
|
54 |
*) |
|
55 |
// template recycling. Pull these off the floor a bit |
|
56 |
if (not isNegative) and (cTemplateFilter = 4) then |
|
57 |
begin |
|
58 |
for i:= 0 to pred(BasePointsCount) do |
|
59 |
begin |
|
60 |
dec(pa.ar[i].y, 100); |
|
61 |
if pa.ar[i].y < 0 then |
|
62 |
pa.ar[i].y:= 0; |
|
63 |
end; |
|
64 |
for i:= 0 to pred(FillPointsCount) do |
|
65 |
begin |
|
66 |
dec(fps^[i].y, 100); |
|
67 |
if fps^[i].y < 0 then |
|
68 |
fps^[i].y:= 0; |
|
69 |
end; |
|
70 |
end; |
|
71 |
||
72 |
if (canFlip and (getrandom(2) = 0)) then |
|
73 |
begin |
|
74 |
for i:= 0 to pred(BasePointsCount) do |
|
75 |
pa.ar[i].y:= LAND_HEIGHT - 1 - pa.ar[i].y; |
|
76 |
for i:= 0 to pred(FillPointsCount) do |
|
77 |
fps^[i].y:= LAND_HEIGHT - 1 - fps^[i].y; |
|
78 |
end; |
|
79 |
end |
|
80 |
end; |
|
10199 | 81 |
|
82 |
||
83 |
procedure Distort1(var Template: TEdgeTemplate; var pa: TPixAr); |
|
84 |
var i: Longword; |
|
85 |
begin |
|
86 |
for i:= 1 to Template.BezierizeCount do |
|
87 |
begin |
|
88 |
BezierizeEdge(pa, _0_5); |
|
89 |
RandomizePoints(pa); |
|
90 |
RandomizePoints(pa) |
|
91 |
end; |
|
92 |
for i:= 1 to Template.RandPassesCount do |
|
93 |
RandomizePoints(pa); |
|
94 |
BezierizeEdge(pa, _0_1); |
|
95 |
end; |
|
96 |
||
10209 | 97 |
procedure FindPoint(si: LongInt; fillPointsCount: LongWord; var newPoint: TPoint; var pa: TPixAr); |
10208
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
98 |
const mapBorderMargin = 40; |
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
99 |
minDistance = 32; // adjust/parametrize this for different details size |
10205
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
100 |
var p1, p2, p4, fp, mp: TPoint; |
10226 | 101 |
i, t1, t2, iy, ix, aqpb: LongInt; |
102 |
a, b, p, q: LongInt; |
|
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
103 |
dab, d, distL, distR: LongInt; |
10199 | 104 |
begin |
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
105 |
// [p1, p2] is the segment we're trying to divide |
10199 | 106 |
p1:= pa.ar[si]; |
107 |
p2:= pa.ar[si + 1]; |
|
108 |
||
10206 | 109 |
if p2.x = NTPX then |
110 |
// it is segment from last to first point, so need to find first point |
|
111 |
begin |
|
112 |
i:= si - 2; |
|
113 |
while (i >= 0) and (pa.ar[i].x <> NTPX) do |
|
114 |
dec(i); |
|
115 |
p2:= pa.ar[i + 1] |
|
116 |
end; |
|
117 |
||
10201
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
118 |
// perpendicular vector |
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
119 |
a:= p2.y - p1.y; |
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
120 |
b:= p1.x - p2.x; |
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
121 |
dab:= DistanceI(a, b).Round; |
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
122 |
|
10206 | 123 |
// its middle point |
124 |
mp.x:= (p1.x + p2.x) div 2; |
|
125 |
mp.y:= (p1.y + p2.y) div 2; |
|
126 |
||
127 |
// don't process too short segments or those which are too close to map borders |
|
128 |
if (p1.x = NTPX) |
|
129 |
or (dab < minDistance * 3) |
|
10209 | 130 |
or (mp.x < LongInt(leftX) + mapBorderMargin) |
131 |
or (mp.x > LongInt(rightX) - mapBorderMargin) |
|
132 |
or (mp.y < LongInt(topY) + mapBorderMargin) |
|
133 |
or (mp.y > LongInt(LAND_HEIGHT) - mapBorderMargin) |
|
10206 | 134 |
then |
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
135 |
begin |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
136 |
newPoint:= p1; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
137 |
exit; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
138 |
end; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
139 |
|
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
140 |
// find distances to map borders |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
141 |
if a <> 0 then |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
142 |
begin |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
143 |
// left border |
10209 | 144 |
iy:= (LongInt(leftX) + mapBorderMargin - mp.x) * b div a + mp.y; |
10208
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
145 |
d:= DistanceI(mp.x - leftX - mapBorderMargin, mp.y - iy).Round; |
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
146 |
t1:= a * (mp.x - mapBorderMargin) + b * (mp.y - iy); |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
147 |
if t1 > 0 then distL:= d else distR:= d; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
148 |
|
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
149 |
// right border |
10208
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
150 |
iy:= (rightX - mapBorderMargin - mp.x) * b div a + mp.y; |
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
151 |
d:= DistanceI(mp.x - rightX + mapBorderMargin, mp.y - iy).Round; |
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
152 |
if t1 > 0 then distR:= d else distL:= d; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
153 |
end; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
154 |
|
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
155 |
if b <> 0 then |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
156 |
begin |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
157 |
// top border |
10209 | 158 |
ix:= (LongInt(topY) + mapBorderMargin - mp.y) * a div b + mp.x; |
10208
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
159 |
d:= DistanceI(mp.y - topY - mapBorderMargin, mp.x - ix).Round; |
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
160 |
t2:= b * (mp.y - mapBorderMargin) + a * (mp.x - ix); |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
161 |
if t2 > 0 then distL:= min(d, distL) else distR:= min(d, distR); |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
162 |
|
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
163 |
// bottom border |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
164 |
ix:= (LAND_HEIGHT - mapBorderMargin - mp.y) * a div b + mp.x; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
165 |
d:= DistanceI(mp.y - LAND_HEIGHT + mapBorderMargin, mp.x - ix).Round; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
166 |
if t2 > 0 then distR:= min(d, distR) else distL:= min(d, distL); |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
167 |
end; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
168 |
|
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
169 |
// now go through all other segments |
10205
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
170 |
fp:= pa.ar[0]; |
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
171 |
for i:= 0 to pa.Count - 2 do |
10205
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
172 |
if pa.ar[i].x = NTPX then |
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
173 |
fp:= pa.ar[i + 1] |
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
174 |
else if (i <> si) then |
10199 | 175 |
begin |
10205
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
176 |
p4:= pa.ar[i + 1]; |
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
177 |
if p4.x = NTPX then |
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
178 |
p4:= fp; |
10206 | 179 |
|
10199 | 180 |
// check if it intersects |
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
181 |
t1:= (mp.x - pa.ar[i].x) * b - a * (mp.y - pa.ar[i].y); |
10205
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
182 |
t2:= (mp.x - p4.x) * b - a * (mp.y - p4.y); |
10199 | 183 |
|
184 |
if (t1 > 0) <> (t2 > 0) then // yes it does, hard arith follows |
|
185 |
begin |
|
10205
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
186 |
p:= p4.x - pa.ar[i].x; |
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
187 |
q:= p4.y - pa.ar[i].y; |
10199 | 188 |
aqpb:= a * q - p * b; |
189 |
||
190 |
if (aqpb <> 0) then |
|
191 |
begin |
|
192 |
// (ix; iy) is intersection point |
|
10226 | 193 |
iy:= ((Int64(pa.ar[i].x - mp.x) * b + Int64(mp.y) * a) * q - Int64(pa.ar[i].y) * p * b) div aqpb; |
10201
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
194 |
if abs(b) > abs(q) then |
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
195 |
ix:= (iy - mp.y) * a div b + mp.x |
10199 | 196 |
else |
10201
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
197 |
ix:= (iy - pa.ar[i].y) * p div q + pa.ar[i].x; |
10199 | 198 |
|
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
199 |
d:= DistanceI(mp.y - iy, mp.x - ix).Round; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
200 |
t1:= b * (mp.y - iy) + a * (mp.x - ix); |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
201 |
if t1 > 0 then distL:= min(d, distL) else distR:= min(d, distR); |
10199 | 202 |
end; |
203 |
end; |
|
204 |
end; |
|
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
205 |
|
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
206 |
// go through all points, including fill points |
10209 | 207 |
for i:= 0 to Pred(pa.Count + fillPointsCount) do |
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
208 |
// if this point isn't on current segment |
10205
fc99e124ba4d
Prevent intersections with segment from last to first point, adjust size of details
unc0rr
parents:
10204
diff
changeset
|
209 |
if (si <> i) and (i <> si + 1) and (pa.ar[i].x <> NTPX) then |
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
210 |
begin |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
211 |
// also check intersection with rays through pa.ar[i] if this point is good |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
212 |
t1:= (p1.x - pa.ar[i].x) * b - a * (p1.y - pa.ar[i].y); |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
213 |
t2:= (p2.x - pa.ar[i].x) * b - a * (p2.y - pa.ar[i].y); |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
214 |
if (t1 > 0) <> (t2 > 0) then |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
215 |
begin |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
216 |
// ray from p1 |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
217 |
p:= pa.ar[i].x - p1.x; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
218 |
q:= pa.ar[i].y - p1.y; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
219 |
aqpb:= a * q - p * b; |
10201
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
220 |
|
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
221 |
if (aqpb <> 0) then |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
222 |
begin |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
223 |
// (ix; iy) is intersection point |
10226 | 224 |
iy:= ((Int64(p1.x - mp.x) * b + Int64(mp.y) * a) * q - Int64(p1.y) * p * b) div aqpb; |
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
225 |
if abs(b) > abs(q) then |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
226 |
ix:= (iy - mp.y) * a div b + mp.x |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
227 |
else |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
228 |
ix:= (iy - p1.y) * p div q + p1.x; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
229 |
|
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
230 |
d:= DistanceI(mp.y - iy, mp.x - ix).Round; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
231 |
t1:= b * (mp.y - iy) + a * (mp.x - ix); |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
232 |
if t1 > 0 then distL:= min(d, distL) else distR:= min(d, distR); |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
233 |
end; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
234 |
|
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
235 |
// and ray from p2 |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
236 |
p:= pa.ar[i].x - p2.x; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
237 |
q:= pa.ar[i].y - p2.y; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
238 |
aqpb:= a * q - p * b; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
239 |
|
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
240 |
if (aqpb <> 0) then |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
241 |
begin |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
242 |
// (ix; iy) is intersection point |
10226 | 243 |
iy:= ((Int64(p2.x - mp.x) * b + Int64(mp.y) * a) * q - Int64(p2.y) * p * b) div aqpb; |
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
244 |
if abs(b) > abs(q) then |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
245 |
ix:= (iy - mp.y) * a div b + mp.x |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
246 |
else |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
247 |
ix:= (iy - p2.y) * p div q + p2.x; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
248 |
|
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
249 |
d:= DistanceI(mp.y - iy, mp.x - ix).Round; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
250 |
t2:= b * (mp.y - iy) + a * (mp.x - ix); |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
251 |
if t2 > 0 then distL:= min(d, distL) else distR:= min(d, distR); |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
252 |
end; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
253 |
end; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
254 |
end; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
255 |
|
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
256 |
// don't move new point for more than length of initial segment |
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
257 |
// adjust/parametrize for more flat surfaces (try values 3/4, 1/2 of dab, or even 1/4) |
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
258 |
d:= dab; |
10201
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
259 |
if distL > d then distL:= d; |
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
260 |
if distR > d then distR:= d; |
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
261 |
|
10204 | 262 |
if distR + distL < minDistance * 2 + 10 then |
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
263 |
begin |
10225 | 264 |
// limits are too narrow, just divide |
265 |
newPoint.x:= mp.x; |
|
266 |
newPoint.y:= mp.y; |
|
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
267 |
end |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
268 |
else |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
269 |
begin |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
270 |
// select distance within [-distL; distR] |
10209 | 271 |
d:= -distL + minDistance + LongInt(GetRandom(distR + distL - minDistance * 2)); |
10201
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
272 |
//d:= distR - minDistance; |
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
273 |
//d:= - distL + minDistance; |
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
274 |
|
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
275 |
// calculate new point |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
276 |
newPoint.x:= mp.x + a * d div dab; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
277 |
newPoint.y:= mp.y + b * d div dab; |
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
278 |
end; |
10199 | 279 |
end; |
280 |
||
10209 | 281 |
procedure DivideEdges(fillPointsCount: LongWord; var pa: TPixAr); |
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
282 |
var i, t: LongInt; |
10200
edc2fe0ca03f
More math, implementation is nearly complete, just still have an issue to resolve
unc0rr
parents:
10199
diff
changeset
|
283 |
newPoint: TPoint; |
10199 | 284 |
begin |
10209 | 285 |
newPoint.x:= 0; |
286 |
newPoint.y:= 0; |
|
10199 | 287 |
i:= 0; |
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
288 |
|
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
289 |
while i < pa.Count - 1 do |
10199 | 290 |
begin |
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
291 |
FindPoint(i, fillPointsCount, newPoint, pa); |
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
292 |
|
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
293 |
if (newPoint.x <> pa.ar[i].x) or (newPoint.y <> pa.ar[i].y) then |
10199 | 294 |
begin |
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
295 |
// point found, free a slot for it in array, don't forget to move appended fill points |
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
296 |
for t:= pa.Count + fillPointsCount downto i + 2 do |
10202
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
297 |
pa.ar[t]:= pa.ar[t - 1]; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
298 |
inc(pa.Count); |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
299 |
pa.ar[i + 1]:= newPoint; |
f7c8cb11a70e
No self intersections, except for weirdness between first and last point
unc0rr
parents:
10201
diff
changeset
|
300 |
inc(i) |
10199 | 301 |
end; |
302 |
inc(i) |
|
303 |
end; |
|
304 |
end; |
|
305 |
||
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
306 |
procedure Distort2(var Template: TEdgeTemplate; fps: PPointArray; var pa: TPixAr); |
10201
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
307 |
var i: Longword; |
10199 | 308 |
begin |
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
309 |
// append fill points to ensure distortion won't move them to other side of segment |
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
310 |
for i:= 0 to pred(Template.FillPointsCount) do |
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
311 |
begin |
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
312 |
pa.ar[pa.Count + i].x:= fps^[i].x; |
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
313 |
pa.ar[pa.Count + i].y:= fps^[i].y; |
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
314 |
end; |
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
315 |
|
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
316 |
// divide while it divides |
10203 | 317 |
repeat |
318 |
i:= pa.Count; |
|
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
319 |
DivideEdges(Template.FillPointsCount, pa) |
10203 | 320 |
until i = pa.Count; |
10201
9bee9541edf1
Fix detection of intersections, still need to check if passing any point in move, but result is already okayish
unc0rr
parents:
10200
diff
changeset
|
321 |
|
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
322 |
// make it smooth |
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
323 |
BezierizeEdge(pa, _0_2); |
10199 | 324 |
end; |
325 |
||
326 |
||
10198 | 327 |
procedure GenTemplated(var Template: TEdgeTemplate); |
328 |
var pa: TPixAr; |
|
329 |
i: Longword; |
|
330 |
y, x: Longword; |
|
331 |
fps: TPointArray; |
|
332 |
begin |
|
333 |
fps:=Template.FillPoints^; |
|
334 |
ResizeLand(Template.TemplateWidth, Template.TemplateHeight); |
|
335 |
for y:= 0 to LAND_HEIGHT - 1 do |
|
336 |
for x:= 0 to LAND_WIDTH - 1 do |
|
337 |
Land[y, x]:= lfBasic; |
|
10208
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
338 |
|
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
339 |
MaxHedgehogs:= Template.MaxHedgehogs; |
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
340 |
hasGirders:= Template.hasGirders; |
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
341 |
playHeight:= Template.TemplateHeight; |
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
342 |
playWidth:= Template.TemplateWidth; |
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
343 |
leftX:= (LAND_WIDTH - playWidth) div 2; |
10209 | 344 |
rightX:= Pred(leftX + playWidth); |
10208
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
345 |
topY:= LAND_HEIGHT - playHeight; |
f04fdb35fc33
- Limit outline to leftX/rightX/topY instead of LAND_WIDTH/LAND_HEIGHT
unc0rr
parents:
10207
diff
changeset
|
346 |
|
10198 | 347 |
{$HINTS OFF} |
348 |
SetPoints(Template, pa, @fps); |
|
349 |
{$HINTS ON} |
|
350 |
||
10207
9dd3a44805a1
- Make sure distortion doesn't move fill point to other side of segment, this prevents corrupted maps
unc0rr
parents:
10206
diff
changeset
|
351 |
Distort2(Template, @fps, pa); |
10198 | 352 |
|
353 |
DrawEdge(pa, 0); |
|
354 |
||
355 |
with Template do |
|
356 |
for i:= 0 to pred(FillPointsCount) do |
|
357 |
with fps[i] do |
|
358 |
FillLand(x, y, 0, 0); |
|
359 |
||
360 |
DrawEdge(pa, lfBasic); |
|
361 |
||
362 |
// HACK: force to only cavern even if a cavern map is invertable if cTemplateFilter = 4 ? |
|
363 |
if (cTemplateFilter = 4) |
|
364 |
or (Template.canInvert and (getrandom(2) = 0)) |
|
365 |
or (not Template.canInvert and Template.isNegative) then |
|
366 |
begin |
|
367 |
hasBorder:= true; |
|
368 |
for y:= 0 to LAND_HEIGHT - 1 do |
|
369 |
for x:= 0 to LAND_WIDTH - 1 do |
|
370 |
if (y < topY) or (x < leftX) or (x > rightX) then |
|
371 |
Land[y, x]:= 0 |
|
372 |
else |
|
373 |
begin |
|
374 |
if Land[y, x] = 0 then |
|
375 |
Land[y, x]:= lfBasic |
|
376 |
else if Land[y, x] = lfBasic then |
|
377 |
Land[y, x]:= 0; |
|
378 |
end; |
|
379 |
end; |
|
380 |
end; |
|
381 |
||
382 |
||
383 |
end. |