Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Forget about triangles and voxels

Name: Anonymous 2020-07-23 15:23

https://www.alanzucconi.com/2016/07/01/signed-distance-functions/

Unless your 3d engine supports infinite resolution, you're a loser.

Name: Anonymous 2020-07-23 19:53

Here that guy livestreams modelling right in shader language:
https://www.youtube.com/watch?v=-pdSjBPH3zM

Name: Anonymous 2020-07-24 1:31

I'm sorry, that's not millions of tiny little atoms.

Name: Anonymous 2020-07-24 2:38

>>1
based and SDF-pilled. I like the idea of optimizing object representation by optimizing the underlying functions: however the generic idea here is to stack functions on top of each other like lego blocks, which seems to quickly increase complexity for anything past 10+ components

Name: Anonymous 2020-07-24 13:24

>>4
Only the local complexity. Globally complexity is still optimized out with BVH. And with triangles local complexity increases faster anyway. Then again, you can create say a neural net to represent your super complex object as a simplified function. In fact, that SDF appears to inherently mixable with ANNs.

Name: Anonymous 2020-07-24 17:59

Nah, you only need Planck length. Infinity is a bunch of Jewish bullshit.

Name: Anonymous 2020-07-24 20:09

>>6
If your field is not complete, you're stuck with basic arithmetic, no proper calculus or anything that requires taking limits.

Name: Anonymous 2020-07-25 15:04

>>7
Epsilon–delta limits work just fine on metric spaces. Do you even math?

Name: Anonymous 2020-07-26 10:16

>>8
Epsilon–delta limits work just fine on metric spaces. Do you even math?
The ironing. You need complete spaces otherwise the limit can be outside the space and you cannot take the distance between the limit and elements of your series because your distance function must have both arguments from the space.

Name: Anonymous 2020-07-26 19:21

>>9
And what part of having a fixed lower bound on distance, e.g. Planck length, precludes that?

Name: Anonymous 2020-07-26 20:35

>>10
fixed lower bound on distance
That is a separate and entirely legitimate question. If your distance function is either at least LOW or exactly 0, so that there are no distances in the open interval (0,LOW), then your convergent series can only be of a very particular form. For a[i] to converge to LIM, for any delta there must be a starting N over which dist(a[i>N],LIM)<delta. Pick delta=LOW/2 and you get a starting N over which the distances are under LOW and therefore 0, so a[i>N]=LIM. So the only convergent series are those that after a finite number of terms switch to a constant and never deviate again. So you get craziness like picking some nonzero X and having a[i]=X/2**i not being convergent. Your space only consists of isolated points and its interior is empty. So you won't be taking any nonconstant limits, like those needed for derivatives, and you don't get any proper calculus.

Name: Anonymous 2020-07-26 23:14

>>11
Not sure why it's separate when that was the entirety of my point. Maybe you're are confusing infinite resolution with infinite bounds, now that really is a separate question. However for volumetric rendering on binary computers, this thread is completely moot for either end of the scale, which is fine since the universe itself is discrete.

Name: Anonymous 2020-07-27 3:05

>>12
Not sure why it's separate when that was the entirety of my point.
It's separate from the completeness problem from >>9 that it was posted as replying to. Both problems -- lack of completeness and "fixed lower bound" -- lead, through different routes, to the same result: inability to take commonly needed limits.

Maybe you're are confusing infinite resolution with infinite bounds
1. The distance between any two points in a metric space is finite, because the distance function is defined from the product SxS with values in the nonnegative reals, so a volume is either unbounded or its bounds are automatically finite.
2. "Infinite resolution" on the distance function is precisely what is mandatory for convergence to work as expected, and what "having a fixed lower bound on distance, e.g. Planck length >>10" prevents.

since the universe itself is discrete.
And as soon as you present your mathematically consistent proof of this to the larger scientific community, your Nobel prize is a foregone conclusion.

Name: Anonymous 2020-07-27 8:54

>>13
There is no Nobel prize in mathematics, dolt.

Name: Anonymous 2020-07-27 9:48

>>14
mathematically consistent proof of this to the larger scientific community
There is no Nobel prize in mathematics
I mistakenly assumed that you had the capacity to infer that the Nobel prize would evidently be in physics and that mathematical consistency would be required between your proposed model and your experimental proof that it is not continuous. It is not enough to show empirically that Newtonian gravity is untenable, e.g. precession of Mercury, someone also has to propose a mathematically consistent alternative. Then the only way you don't get a Nobel prize for that is if you already have one and they don't give you two in the same discipline.

dolt
The ironing.

Name: Anonymous 2020-07-27 10:56

>>15
Just jump into a black hole and see for itself that it ends there.

Name: Anonymous 2020-07-27 19:07

poop

Don't change these.
Name: Email:
Entire Thread Thread List