Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Rename kD splay trees to Bounding Volume Splay Trees. | Tavian Barnes | 2010-01-15 | 1 | -464/+0 |
| | |||||
* | Calculate transformed surface normals correctly. | Tavian Barnes | 2010-01-09 | 1 | -3/+9 |
| | |||||
* | Use dmnsn_new_*() rather than dmnsn_*_construct(). | Tavian Barnes | 2009-11-19 | 1 | -7/+7 |
| | |||||
* | Use finishes. | Tavian Barnes | 2009-11-09 | 1 | -4/+7 |
| | |||||
* | Calculate surface normals in intersection callbacks. | Tavian Barnes | 2009-11-09 | 1 | -2/+10 |
| | |||||
* | Store inverse object transformation in a separate field. | Tavian Barnes | 2009-11-09 | 1 | -12/+13 |
| | |||||
* | Fix dmnsn_kD_splay_node_swallow() typo. | Tavian Barnes | 2009-10-30 | 1 | -4/+4 |
| | |||||
* | Major dmnsn_kD_splay_search() optimization. | Tavian Barnes | 2009-10-26 | 1 | -19/+21 |
| | | | | | | | | At each level of recursion, we have to go down the right branch if it exists. But if we do this before we test the current node and the left branch, we can eliminate those tests in the likely case that we find a closer object in the geometrically larger right subtree. This gives about a 2X speed improvement according to `make bench'. | ||||
* | Fix some memory leaks. | Tavian Barnes | 2009-10-19 | 1 | -10/+16 |
| | | | | | dmnsn_delete_pigment() was not using the free_fn, and kD splay trees were not being deleted after raytracing finished. | ||||
* | Fix ray-box intersection test. | Tavian Barnes | 2009-10-13 | 1 | -4/+4 |
| | |||||
* | Remove unused variable from dmnsn_kD_splay_search_recursive(). | Tavian Barnes | 2009-10-09 | 1 | -1/+0 |
| | |||||
* | kD splay tree fixes, and new dmnsn_kD_splay_tree type. | Tavian Barnes | 2009-10-09 | 1 | -187/+156 |
| | |||||
* | kD splay tree fixes. | Tavian Barnes | 2009-10-09 | 1 | -4/+8 |
| | |||||
* | Typo fixes in kD_splay_tree.c. | Tavian Barnes | 2009-10-07 | 1 | -8/+8 |
| | |||||
* | Test object's bounding boxes too in dmnsn_kD_splay_search(). | Tavian Barnes | 2009-10-07 | 1 | -13/+30 |
| | |||||
* | Implement search for kD splay trees. | Tavian Barnes | 2009-10-07 | 1 | -0/+173 |
| | |||||
* | Call kD splay children `contains' and `container'. | Tavian Barnes | 2009-10-07 | 1 | -35/+35 |
| | |||||
* | Fix kD splay tree rotations. | Tavian Barnes | 2009-10-06 | 1 | -21/+57 |
| | |||||
* | Implement insert for kD splay trees. | Tavian Barnes | 2009-10-05 | 1 | -0/+115 |
| | |||||
* | Implement splay operation for kD splay trees. | Tavian Barnes | 2009-10-05 | 1 | -1/+58 |
| | |||||
* | Begin kD splay tree implementation. | Tavian Barnes | 2009-10-05 | 1 | -0/+68 |