Some seemingly hopeless technical problems have an easy solution when you’re willing to take radical steps. I remember @billyzelsnack as the master of this, with perspective-correct texture mapping with a per-pixel divide, and a 256Klookup table for lighting...on a 486!
-
-
Using base 32 in a configuration similar to the E8 lattice for analysis and simulation (and rendering I suppose.) Are you still interested in using big numbers for polyhedra, or was that a passing fancy?
-
The exact-CSG-using-rational-bignums approach is sound. Of course it doesn’t help with the more interesting problem of exact CSG on curved surfaces.
- 2 more replies
New conversation -
-
-
GOW4 lighting was 2,500 per light, so getting close :)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Neural networks for hash functions?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Perhaps the other way around: still using lookup tables, because it can still be mighty fast. :)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I think the exorbitant memory requirement tops the list for me. I believe in Go its 50%...
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
This Tweet is unavailable.
-
-
Accepting data copy instead of sharing? I often feel that many programmers still live in a world of single CPU sockets and low memory machines, where the compiler still doesn't know how to do copy-elision, while still manipulating megabytes assets.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
Show additional replies, including those that may contain offensive content
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.