- Joined
- Feb 8, 2012
- Messages
- 3,014 (0.63/day)
- Location
- Zagreb, Croatia
System Name | Windows 10 64-bit Core i7 6700 |
---|---|
Processor | Intel Core i7 6700 |
Motherboard | Asus Z170M-PLUS |
Cooling | Corsair AIO |
Memory | 2 x 8 GB Kingston DDR4 2666 |
Video Card(s) | Gigabyte NVIDIA GeForce GTX 1060 6GB |
Storage | Western Digital Caviar Blue 1 TB, Seagate Baracuda 1 TB |
Display(s) | Dell P2414H |
Case | Corsair Carbide Air 540 |
Audio Device(s) | Realtek HD Audio |
Power Supply | Corsair TX v2 650W |
Mouse | Steelseries Sensei |
Keyboard | CM Storm Quickfire Pro, Cherry MX Reds |
Software | MS Windows 10 Pro 64-bit |
They are twisting it, of course, for marketing or fraud sakeIt's a scam because infinite data points = impossible.
![Big Grin :D :D](https://tpucdn.com/forums/data/assets/smilies/biggrin-v1.gif)
Essentially each pixel drawn on 2d screen is a ray trace query on this huge voxel oct-tree hierarchy, only visibility query without any reflecting or refracting ... just find me the color of the first voxel you hit and make sure it's the right size (right hierarchy level). Meaning as high in hiearachy as possible while its 2d projection is still contained entirely inside the pixel.
This is all about source of the assets being laser scanned environment. But, for example, Google does laser scanning for cities in google earth ... and they have much better engine for displaying that data ... it doesn't peg the CPU and uses GPU efficiently, unlike euclideon tech.And actually, tech to convert polygons to rough voxel-likes exist. I worked on one for Minecraft of all things. This isn't that different.
I'm sure google uses same oct-tree structure for voxels (for the same efficiency), they just managed to write a GPGPU code for real time conversion to polys.
Last edited: