-
Notifications
You must be signed in to change notification settings - Fork 1
/
scratch.py
417 lines (310 loc) · 11.3 KB
/
scratch.py
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
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
from math import *
dont_care = 0.001
def dot(lhs, rhs):
acc = 0
for a, b in zip(lhs, rhs):
acc += a * b
return acc
def length(vec):
return sqrt(dot(vec, vec))
def add(lhs, rhs):
return tuple([a + b for a, b in zip(lhs, rhs)])
def sub(lhs, rhs):
return tuple([a - b for a, b in zip(lhs, rhs)])
def div(vec, d):
return tuple([s / d for s in vec])
def mul(vec, d):
return tuple([s * d for s in vec])
def distance(lhs, rhs):
return length(sub(rhs, lhs))
def normalize(vec):
return div(vec, length(vec))
def sdf_sphere(point, radius):
return length(point) - radius
def sdf_box(point, extent):
fnord = sub(map(abs, point), extent)
return length([max(i, 0) for i in fnord]) + min(max(*fnord), 0.0)
def translate(point, offset):
return sub(point, offset)
def sdf_union(*sdfs):
return min(*sdfs)
def sign(n):
return -1 if n < 0 else 1
def pretty_float(ok_float):
return floor(abs(ok_float) * 10000000) / 10000000.0 * sign(ok_float)
class sample:
def __init__(self, tx, sd):
self.tx = tx
self.sd = sd
def __repr__(self):
return "(tx: {}, sd: {})".format(self.tx, self.sd)
def next_tx(samples, t_start, t_end):
dont_care = 0.001
nearest = samples[0].tx - abs(samples[0].sd)
if nearest > (t_start + dont_care):
#print("search: gap at front")
return nearest * 0.5, 0
if len(samples) > 1:
for i in range(len(samples)-1):
lhs = samples[i]
rhs = samples[i+1]
low = lhs.tx + abs(lhs.sd)
high = rhs.tx - abs(rhs.sd)
if ((low + dont_care) < high):
#print("search: gap between {} and {}".format(i, i+1))
return (high-low) * 0.5 + low, i+1
elif lhs.sd < dont_care:
return None, i
elif rhs.sd < dont_care:
return None, i+1
farthest = samples[-1].tx + abs(samples[1].sd)
if (farthest + dont_care) < t_end:
#print("search: gap at end")
return (t_end - farthest) * 0.5 + farthest, -1
return None, None
def search(ray_start, ray_end, ray_dir, sdfn):
t_start = 0
t_end = distance(ray_end, ray_start)
t_mid = t_end * 0.5
def new_sample(tx):
global sample
pos = add(ray_start, mul(ray_dir, tx))
sdf = sdfn(pos)
return sample(tx, sdf)
samples = [new_sample(t_mid)]
t_next, param = next_tx(samples, t_start, t_end)
while t_next is not None:
fnord = new_sample(t_next)
if param == -1:
samples.append(fnord)
else:
samples.insert(param, fnord)
t_next, param = next_tx(samples, t_start, t_end)
hit = None
if param is not None:
t_hit = samples[param].tx + samples[param].sd
hit = new_sample(t_hit)
return "NEW", samples, hit
class coverage:
def __init__(self, tx, sd):
global dont_care
if sd is None:
self.low = tx
self.high = tx
self.sign = 0
else:
self.low = tx - abs(sd)
self.high = tx + abs(sd)
self.sign = -1 if sd < dont_care else 1
def __repr__(self):
return "({} -> {}: {})".format(self.low, self.high, self.sign)
def search2(ray_start, ray_end, ray_dir, sdfn):
global dont_care
t_start = 0
t_end = distance(ray_end, ray_start)
t_mid = t_end * 0.5
pos_at_t = lambda t: add(ray_start, mul(ray_dir, t))
sd_at_t = lambda t: sdfn(pos_at_t(t))
stack = [coverage(t_end + dont_care, None), coverage(t_mid, sd_at_t(t_mid))]
target = coverage(0.0, None)
max_stack = len(stack)
iterations = 0
sdfn_calls = 1
while len(stack):
iterations += 1
if (stack[-1].low - dont_care) <= target.high:
target = stack.pop()
#print("pop: {}".format(target))
if target.sign < 0:
break
else:
t_next = (stack[-1].low + target.high) * 0.5
sd_next = sd_at_t(t_next)
sdfn_calls += 1
fnord = coverage(t_next, sd_next)
if stack[-1].sign == fnord.sign and (stack[-1].low - dont_care) <= fnord.high:
stack[-1].low = fnord.low
#print("merged: {}".format(stack[-1]))
else:
stack.append(coverage(t_next, sd_next))
#print("push: {}".format(stack[-1]))
max_stack = max(max_stack, len(stack))
cmp = search(ray_start, ray_end, ray_dir, sdfn)[-1]
if cmp is not None:
print("Ref Hit: {} -> {}".format(pos_at_t(cmp.tx), pretty_float(cmp.sd)))
else:
print("Ref Miss")
if target.sign == -1:
t_hit = max(t_start, target.low)
p_hit = pos_at_t(t_hit)
sd_hit = sdfn(p_hit)
print("Ray Hit: {} -> {}".format(p_hit, pretty_float(sd_hit)))
else:
print("Ray Miss")
print("Max Stack: {}".format(max_stack))
print("Iterations: {}".format(iterations))
print("SDF Calls: {}".format(sdfn_calls))
print("\n\n")
def sphere_march(ray_start, ray_end, ray_dir, sdfn):
t_start = 0
t_end = distance(ray_end, ray_start)
t_mid = t_end * 0.5
t_next = t_start
dont_care = 0.001
def new_sample(tx):
global sample
pos = add(ray_start, mul(ray_dir, tx))
sdf = sdfn(pos)
return sample(tx, sdf)
samples = [new_sample(t_start)]
while samples[-1].sd >= dont_care and t_next <= t_end:
t_next += samples[-1].sd
samples.append(new_sample(t_next))
hit = None
if samples[-1].sd < dont_care:
hit = samples[-1]
return "OLD", samples, hit
def report(run, trial, ray_start, ray_dir):
name, samples, hit = trial
print("--------------------------------------------------------------------------------")
print("{}: {}".format(run.upper(), name.upper()))
print("\n samples: {}".format(len(samples)))
if 0:
for i, sample in enumerate(samples):
print(" {}: {}".format(i, sample))
if hit:
print("\n ray hit:")
print(" {}".format(hit))
dont_care = 0.001
error = pretty_float(abs(hit.sd))
print(" error: {}".format(error))
else:
print("\n ray miss")
print()
def case1():
ray_start = (-1.0, -2.0, 0.0)
ray_end = (1.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
sdfn = lambda p: sdf_sphere(p, 1.0)
rprt = lambda t: report("case 1", t, ray_start, ray_dir)
rprt(sphere_march(ray_start, ray_end, ray_dir, sdfn))
rprt(search(ray_start, ray_end, ray_dir, sdfn))
def case1a():
ray_start = (-1.0, -2.0, 0.0)
ray_end = (1.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
sdfn = lambda p: sdf_sphere(p, 1.0)
search2(ray_start, ray_end, ray_dir, sdfn)
def case2():
ray_start = (1.0, -2.0, 0.0)
ray_end = (1.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
sdfn = lambda p: sdf_sphere(p, 1.0)
rprt = lambda t: report("case 2", t, ray_start, ray_dir)
rprt(sphere_march(ray_start, ray_end, ray_dir, sdfn))
rprt(search(ray_start, ray_end, ray_dir, sdfn))
def case2a():
ray_start = (1.0, -2.0, 0.0)
ray_end = (1.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
sdfn = lambda p: sdf_sphere(p, 1.0)
search2(ray_start, ray_end, ray_dir, sdfn)
def case3():
ray_start = (1.0, -2.0, 0.0)
ray_end = (1.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
sdfn = lambda p: sdf_sphere(p, 0.999)
rprt = lambda t: report("case 3", t, ray_start, ray_dir)
rprt(sphere_march(ray_start, ray_end, ray_dir, sdfn))
rprt(search(ray_start, ray_end, ray_dir, sdfn))
def case3a():
ray_start = (1.0, -2.0, 0.0)
ray_end = (1.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
sdfn = lambda p: sdf_sphere(p, 0.999)
search2(ray_start, ray_end, ray_dir, sdfn)
def case4():
ray_start = (0.0, -2.0, 0.0)
ray_end = (0.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
rprt = lambda t: report("case 4", t, ray_start, ray_dir)
def sdfn(point):
return sdf_union(
sdf_sphere(translate(point, (-1.0, 1.0, 0.0)), 0.999),
sdf_sphere(translate(point, (1.0, -1.0, 0.0)), 0.999),
sdf_sphere(translate(point, (-1.0, 1.0, 0.0)), 0.999))
rprt(sphere_march(ray_start, ray_end, ray_dir, sdfn))
rprt(search(ray_start, ray_end, ray_dir, sdfn))
def case4a():
ray_start = (0.0, -2.0, 0.0)
ray_end = (0.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
def sdfn(point):
return sdf_union(
sdf_sphere(translate(point, (-1.0, 1.0, 0.0)), 0.999),
sdf_sphere(translate(point, (1.0, -1.0, 0.0)), 0.999),
sdf_sphere(translate(point, (-1.0, 1.0, 0.0)), 0.999))
search2(ray_start, ray_end, ray_dir, sdfn)
def case5():
ray_start = (0.0, -2.0, 0.0)
ray_end = (0.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
sdfn = lambda p: sdf_box(p, (1.0, 1.0, 1.0))
rprt = lambda t: report("case 5", t, ray_start, ray_dir)
rprt(sphere_march(ray_start, ray_end, ray_dir, sdfn))
rprt(search(ray_start, ray_end, ray_dir, sdfn))
def case5a():
ray_start = (0.0, -2.0, 0.0)
ray_end = (0.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
sdfn = lambda p: sdf_box(p, (1.0, 1.0, 1.0))
search2(ray_start, ray_end, ray_dir, sdfn)
def case6():
ray_start = (0.0, -2.0, 0.0)
ray_end = (0.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
rprt = lambda t: report("case 6", t, ray_start, ray_dir)
def sdfn(point):
return sdf_box(translate(point, (1.0, 0.0, 0.0)), (0.999, 2.0, 1.0))
rprt(sphere_march(ray_start, ray_end, ray_dir, sdfn))
rprt(search(ray_start, ray_end, ray_dir, sdfn))
def case6a():
ray_start = (0.0, -2.0, 0.0)
ray_end = (0.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
def sdfn(point):
return sdf_box(translate(point, (1.0, 0.0, 0.0)), (0.999, 2.0, 1.0))
search2(ray_start, ray_end, ray_dir, sdfn)
def case7():
ray_start = (0.0, -2.0, 0.0)
ray_end = (0.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
rprt = lambda t: report("case 7", t, ray_start, ray_dir)
def sdfn(point):
return sdf_box(translate(point, (0.0, -1.9, 0.0)), (1.0, 0.01, 1.0))
rprt(sphere_march(ray_start, ray_end, ray_dir, sdfn))
rprt(search(ray_start, ray_end, ray_dir, sdfn))
def case7a():
ray_start = (0.0, -2.0, 0.0)
ray_end = (0.0, 2.0, 0.0)
ray_dir = normalize(sub(ray_end, ray_start))
def sdfn(point):
return sdf_box(translate(point, (0.0, -1.9, 0.0)), (1.0, 0.01, 1.0))
search2(ray_start, ray_end, ray_dir, sdfn)
if __name__ == "__main__":
if 0:
case1()
case2()
case3()
case4()
case5()
case6()
case7()
else:
case1a()
case2a()
case3a()
case4a()
case5a()
case6a()
case7a()