Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Don't use an anonymous union in prtree.c. | Tavian Barnes | 2010-06-06 | 1 | -25/+25 |
| | |||||
* | New bounding box special constructors. | Tavian Barnes | 2010-06-06 | 1 | -28/+14 |
| | |||||
* | New dmnsn_prtree_inside() function, rename dmnsn_prtree_search(). | Tavian Barnes | 2010-06-06 | 1 | -6/+46 |
| | |||||
* | Add children to dmnsn_objects, which enables splitting unions. | Tavian Barnes | 2010-06-05 | 1 | -1/+25 |
| | | | | Also, use PR-trees for unions internally. | ||||
* | Precompute objects in dmnsn_raytrace_scene() rather than dmnsn_new_prtree(). | Tavian Barnes | 2010-05-30 | 1 | -11/+0 |
| | |||||
* | Slight prtree search optimization. | Tavian Barnes | 2010-05-29 | 1 | -5/+5 |
| | | | | Exploit floating-point infinities to eliminate special t < 0.0 condition. | ||||
* | Store the bounding boxes of child PR-tree nodes in the parent. | Tavian Barnes | 2010-05-20 | 1 | -56/+63 |
| | | | | This improves cache locality and is good for about a 10% performance boost. | ||||
* | Write some more docs, and fix a couple things noticed while writing them. | Tavian Barnes | 2010-05-10 | 1 | -2/+2 |
| | |||||
* | New DMNSN_ARRAY_FOREACH() macro, faster than iterating with dmnsn_array_get(). | Tavian Barnes | 2010-05-08 | 1 | -9/+4 |
| | |||||
* | Handle degenerate cases in ray/box intersections. | Tavian Barnes | 2010-05-08 | 1 | -1/+10 |
| | |||||
* | Fix argument to malloc(). | Tavian Barnes | 2010-05-07 | 1 | -1/+1 |
| | |||||
* | Don't store unbounded objects (planes, etc.) in the PR-tree. | Tavian Barnes | 2010-05-07 | 1 | -21/+86 |
| | | | | | Keep them in a dmnsn_array* instead. This makes the tree better and saves us some search time. | ||||
* | Use C99 for loop initializers. | Tavian Barnes | 2010-05-05 | 1 | -15/+11 |
| | |||||
* | Optimize ray-AABB intersection tests a bit. | Tavian Barnes | 2010-05-05 | 1 | -51/+29 |
| | |||||
* | Make dmnsn_new_prtree() handle empty scenes. | Tavian Barnes | 2010-05-05 | 1 | -0/+6 |
| | |||||
* | Replace BVSTs with priority R-trees. | Tavian Barnes | 2010-05-05 | 1 | -0/+574 |