Are there any more detailed papers about the methods and optimizations that are used in Bullet? The Siggraph 2010 BOF presentation, "Rendering The Breeze" (http://www.khronos.org/assets/uploads/d ... -Jul10.pdf
, 4.1 MB PDF file), describes one of the methods that seem to be implemented in Bullet. As far as I could see from the source code, the computation of the "independent subsets of links through graph coloring" is implemented in the OpenCL soft body solver. Is this method described in another paper/publication? Are there any further optimizations to this? E.g. concerning the cache efficiency of the resulting structures, which is occasionally mentioned in the source code, but seems not to be treated explicitly.
Thanks in advance