archive/blender-archive
Archived
1
1
Fork 0
Code Pull Requests Packages Activity
21,121 Commits 660 Branches 0 Tags
2318886f7029cef4c0890d3ae9c56b86cc49d7ad
Commit Graph

21 Commits

Author SHA1 Message Date
Brecht Van Lommel
37e4a311b0 Math Lib 
* Convert all code to use new functions.
* Branch maintainers may want to skip this commit, and run this
  conversion script instead, if they use a lot of math functions
  in new code:
  http://www.pasteall.org/9052/python
 2009-11-10 20:43:45 +00:00
Andre Susano Pinto
55541d8a81 Added some test_break during the build process. 
(Maybe later this should be done with some thread_cancel function instead of doing variable/callbacks tests)
 2009-10-04 16:56:00 +00:00
Andre Susano Pinto
8da55763b5 *Updated UI options and added UI options to: 
control whether instances are used or not
	control whether vertexs are stored localy or not

*Removed unsused code
 2009-10-01 18:30:59 +00:00
Andre Susano Pinto
64af3a2618 *introduced new method for packing/optimizing trees after building 
(this is a generalization of some of the experimental stuff i tried during SoC,
 but only had time to improve a few days ago)
 - it should yield slightly better results
 - the cost model can somehow be tweaked to optimize for diferent trees.

*cleaned up some code
*added counters for number of SIMD BB tests
*added GPL license block on missing files
 2009-09-06 19:14:06 +00:00
Andre Susano Pinto
ea18c6ef0a Code reorganization 
-separated vbvh, svbvh, qbvh in diferent files (before the only way to switch between them was at compile time)
 2009-08-29 17:24:45 +00:00
Andre Susano Pinto
aec7f2f2c4 *Changed RayObject_ calls to RE_rayobject to keep consistency on calls 
*Moved part of counters code to a separated file (rayobject_raycounter.c)
 2009-08-25 20:26:50 +00:00
Andre Susano Pinto
cb40f0ff80 Another tree pass during build to increase the number of nodes that have multipe of 4childs 2009-08-13 15:56:24 +00:00
Andre Susano Pinto
5d40c1b597 *Added a tree structure with a variable number of childs per node, but with groupped childs (for SIMD) 
*SIMD support for the first 4*N childs of each node
*Some bvh code organized
 2009-08-11 00:33:51 +00:00
Andre Susano Pinto
4ce316ee0f Ability to disable hints at compile time 2009-08-10 21:37:16 +00:00
Andre Susano Pinto
51cad12120 *BLI_memarena support for any power of two alignment 
*some simd stuff on bvh
 2009-08-07 13:49:15 +00:00
Andre Susano Pinto
f16df034c3 *Process leafs as soon as found instead of pushing them on stack for later evaluation (leads to early exits) 
(this is mixed with some simd code commit, althouth no simd is being used up to the moment)
 2009-08-06 17:45:51 +00:00
Andre Susano Pinto
bbdba89d06 generic hints for raytracer 
for now only BB hint (i am  hoping to find a decent frustum-test)
 2009-08-05 12:44:11 +00:00
Andre Susano Pinto
2160f36fea Fix point-hint 2009-08-04 18:03:04 +00:00
Andre Susano Pinto
7e9dc51cd1 Skip BB tests on primitives 
the efficiency of this depends on ray-bb and ray-triangle functions efficiency
 2009-08-04 17:24:49 +00:00
Andre Susano Pinto
29530beb90 NlogN building: 
sort once
	select subsets and kept the order (on X, Y and Z)
 2009-08-03 17:56:38 +00:00
Andre Susano Pinto
2830f25ff3 Another try with building better trees (this should never make worst trees) 
Expected number of BB tests should reduce a bit (depending on the scene)
 2009-07-17 19:09:42 +00:00
Andre Susano Pinto
146b54d5e8 *increased stack size (later this should be prepared for dealing with stack size in runtime) 
*put cost model back to normal
 2009-07-15 17:44:25 +00:00
Andre Susano Pinto
ef1fcd8ad1 *Added support to "BB hints" (which works like a BB version of LCTS - longest common transversing subtree) 
It creates a tree cut after knowing that a given point will pass on a BB.
This tree cut is used to accelarate the rays casted from a given BB, eliminating unnecessary BB tests from root till the tree cut.
 2009-07-15 17:38:00 +00:00
Andre Susano Pinto
e3f7cad32d *fix (was losing childs) 2009-07-14 23:26:00 +00:00
Andre Susano Pinto
7afffd2950 Just another experimental stuff to optimize the expected number of BB test on bvh trees 
*tree pushdowns after the pushsups :P (its still not local optimum)
 2009-07-14 23:08:55 +00:00
Andre Susano Pinto
a6b328b825 *Moved rtbuild to bf_render_raytrace 
*Added vbvh - Just a experimental tree type :)
Variable Way BVH - there is no hardcoded number of childs per each Tree Node
 - idea is to optimize a tree to reduced the expected number of BB tests even after applying SAH (for that an hardcoded n-way is not enough)
 - for now childs are stored on a linked list
 2009-07-12 18:04:10 +00:00