Sergey Sharybin 788fb8321a Cycles: Store proper empty boundbox for missing child nodes in QBVH ... The idea is to make sure those childs would never be intersected with a ray in order to make it so kernel never worries about number of child nodes.		2014-12-25 02:50:49 +05:00
..
bvh_binning.cpp	Code cleanup: Add -Werror=float-conversion to Cycles	2014-05-03 07:31:46 +10:00
bvh_binning.h	Cycles: merging features from tomato branch.	2012-04-28 08:53:59 +00:00
bvh_build.cpp	Cycles: Code cleanup, typo	2014-12-10 00:08:33 +05:00
bvh_build.h	Cycles: optimization for hair BVH build, allow max 2 hair curves per leaf.	2014-04-22 17:15:41 +02:00
bvh_node.cpp	Cycles: Use proper node counter to allocate QBVH nodes	2014-12-25 02:50:49 +05:00
bvh_node.h	Cycles: Use proper node counter to allocate QBVH nodes	2014-12-25 02:50:49 +05:00
bvh_params.h	Cycles: Speedup BVH build for certain compilers	2014-11-24 18:50:46 +05:00
bvh_sort.cpp	Cycles code refactor: changes to make adding new primitive types easier.	2014-03-29 13:03:46 +01:00
bvh_sort.h	style cleanup: block comments	2012-06-09 17:22:52 +00:00
bvh_split.cpp	Cycles: optimization for hair BVH build, allow max 2 hair curves per leaf.	2014-04-22 17:15:41 +02:00
bvh_split.h	Cycles: optimization for hair BVH build, allow max 2 hair curves per leaf.	2014-04-22 17:15:41 +02:00
bvh.cpp	Cycles: Store proper empty boundbox for missing child nodes in QBVH	2014-12-25 02:50:49 +05:00
bvh.h	Cycles: Implement watertight ray/triangle intersection	2014-12-25 02:50:49 +05:00
CMakeLists.txt	code cleanup:	2012-10-17 04:13:03 +00:00