filament

Scarfski/filament

Fork 0

Commit Graph

Author	SHA1	Message	Date
Mathias Agopian	38de58007c	checkpoint: ground work for calculating binary light trees computeLightTree() takes a list of light as a bitfield and produces a depth-first binary tree array that can be used to efficiently check which lights volumes contain a given z coordinate in screen space. Currently computeLightTree() produces the array locally on the stack, which isn’t useful, but before we can make use of it, a lot of other things have to happen.	2018-08-22 14:55:17 -07:00
Mathias Agopian	5ed80bc616	Add ctz to utils::algorithm Use CTZ in bitset.forEachBitSet() so we can efficiently go through them in order instead of reverse order.	2018-08-17 19:48:23 -07:00
Romain Guy	b3d758f3b3	Initial commit	2018-08-03 10:38:22 -07:00

Author

SHA1

Message

Date

Mathias Agopian

38de58007c

checkpoint: ground work for calculating binary light trees

computeLightTree() takes a list of light as
a bitfield and produces a depth-first 
binary tree array that can be used to efficiently
check which lights volumes contain a given z
coordinate in screen space.

Currently computeLightTree() produces the array
locally on the stack, which isn’t useful, but
before we can make use of it, a lot of other
things have to happen.

2018-08-22 14:55:17 -07:00

Mathias Agopian

5ed80bc616

Add ctz to utils::algorithm

Use CTZ in bitset.forEachBitSet() so we can
efficiently go through them in order instead of
reverse order.

2018-08-17 19:48:23 -07:00

Romain Guy

b3d758f3b3

Initial commit

2018-08-03 10:38:22 -07:00

3 Commits