Blender Git Loki

Blender Git "cycles_procedural_api" branch commits.

Page: 6 / 24

March 24, 2021, 13:20 (GMT)
Merge branch 'master' into cycles_procedural_api
March 24, 2021, 12:09 (GMT)
format
March 24, 2021, 10:48 (GMT)
Merge branch 'master' into cycles_procedural_api
March 22, 2021, 15:14 (GMT)
Add a proper attribute standard and TypeDesc for deltas.
March 22, 2021, 14:00 (GMT)
Support delta compression on the CPU.
March 22, 2021, 13:54 (GMT)
Add a setting to stop doing deltas after a certain amount of frames.
March 22, 2021, 13:53 (GMT)
Stop computing deltas if rendering is cancelled.
March 22, 2021, 13:36 (GMT)
add options to ignore subdivision, use prefetching, and disable caching
March 22, 2021, 13:35 (GMT)
fix missing prefetching for subdivision meshes
March 22, 2021, 05:47 (GMT)
Allows deltas whose magnitudes are greater that 1.0.
March 22, 2021, 05:42 (GMT)
Fix crashes caused by reading non-existent data

The index_data_map was not swaped with the rest of the data, and there
was no indication that the first frame does no have min/max data for the
delta range.
March 19, 2021, 06:54 (GMT)
several fixes for the delta attribute inside of the procedural
March 19, 2021, 06:53 (GMT)
fix out of bounds access in the kernel
March 19, 2021, 06:53 (GMT)
fix assertion for missing attribute type
March 19, 2021, 06:52 (GMT)
cleanup
March 19, 2021, 03:18 (GMT)
do not pack the data for CPU if not needed, try to make deltas work for
ranges outside of (-1,1)
March 17, 2021, 21:09 (GMT)
fix compile error
March 17, 2021, 20:16 (GMT)
Merge branch 'master' into cycles_procedural_api
March 16, 2021, 03:31 (GMT)
store deltas in some attribute
March 15, 2021, 19:08 (GMT)
Alembic procedural: deduplicate cached data accross frames

Currently the procedural will add an entry to the cache for every frame
even if the data only changes seldomly. This means that in some cases we
will have duplicate data accross frames.

Now we compute a hash for the data and compare it to the one for the
previous frame and only if they are different do we create a new entry.
The hash is computed by the Alembic library (using murmur3).

This can drastically reduce memory usage at the cost of more processing
time. In one file, memory usage goes from 9.08 Gb down to 4.28 Gb over
240 frames.
Tehnyt: Miika HämäläinenViimeksi päivitetty: 07.11.2014 14:18MiikaH:n Sivut a.k.a. MiikaHweb | 2003-2021