Browsed by
Category: Programming

Reducing tree rendering bandwidth

Reducing tree rendering bandwidth

AMD researchers have published a VRAM-saving technique that leverages procedural generation techniques to eliminate the need for sending the GPU 3D geometry altogether. The GPU utilizes work graphs and mesh nodes to produce 3D-rendered trees on the fly at the LOD (Level of Detail) required for the current frame.

Instead of requiring massive amounts of geometry, the only thing transferred is the code needed to generate the trees in the scene – code that is only a few kilobytes instead of megabytes or even gigabytes.

Read the paper here.

Another article here.

Demozoo Demoscene Library

Demozoo Demoscene Library

Crystal Dream

Demozoo.org is a website that is a library of not only old school ’90’s era demo competition submission – but even all the recent ones as well. They have lists of current competitions and news too. An extra feature is many demos have youtube videos of the runs so you don’t have to download the binaries and run them locally.

Programming 90’s demoscene effects

Programming 90’s demoscene effects


NCOT Technology has a number of retro-programming videos. Bonus points for using old school DOS Borland C++ to compile the examples.

This gives you an idea of how things were done, but the reality is that demo scene code was a LOT more complex – full of inline assembly, crazy lookup tables, direct framebuffer manipulation, and every programming and hardware trick known to man. You had to be a wizard of not only coding – but expert at tricking the hardware to do what you wanted too.

Putting spell check in 64k of RAM

Putting spell check in 64k of RAM

Abhinav Upadhyay walks us through a wonderful bit of computer history. He talks about how Steve Johnson at AT&T wrote one of the first spell checkers. His method could encode a word in just 14 bits of memory; so a dictionary with 30,000 entries would take up a fraction under 52 kB. This is even better compression than gzip – and it can perform fast lookups.

Once the dictionary grew to 30,000 words, the Bloom filter approach became impractical. Douglas McIlroy’s solution was to store differences between sorted hash codes , after discovering these differences followed a geometric distribution. These followed a distribution that could be easily run length encoded with something called Golomb’s code.

It’s a fantastic examination of applied computer science. Definitely worth a read

Articles:

What the demo Scene teaches us

What the demo Scene teaches us

Plastic 195/95 is a 20mb demo made by a demo team on their picoEngine v2.1b in 2009

Not to be outdone, RGBA 195/95 is the same demo – done in 64k

These were shared in a presentation on lessons learned from Demo Scene coding: