Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Modularize the libdimension codebase. | Tavian Barnes | 2015-10-25 | 1 | -30/+0 |
| | |||||
* | Use // comments when possible. | Tavian Barnes | 2014-06-07 | 1 | -1/+1 |
| | |||||
* | Allow other BVH implementations to be used. | Tavian Barnes | 2012-12-17 | 1 | -24/+2 |
| | | | | | dmnsn_bvh is now a generic API, which could potentially support octrees, etc, in addition to PR-trees. | ||||
* | Use DMNSN_INTERNAL for prtree functions. | Tavian Barnes | 2011-08-25 | 1 | -5/+8 |
| | |||||
* | Get rid of include guards on sub-headers. | Tavian Barnes | 2011-05-16 | 1 | -5/+0 |
| | |||||
* | Cache previous intersections in dmnsn_prtree_intersection(). | Tavian Barnes | 2011-04-20 | 1 | -1/+2 |
| | | | | | Due to geometric locality of rays, this provides a very large speedup for most scenes. | ||||
* | Add some missing documentation. | Tavian Barnes | 2011-03-08 | 1 | -3/+5 |
| | |||||
* | Update email address. | Tavian Barnes | 2011-03-08 | 1 | -1/+1 |
| | |||||
* | Fix license years. | Tavian Barnes | 2011-02-17 | 1 | -1/+1 |
| | |||||
* | Flatten the pre-order traversal of the PR-tree for better cache locality. | Tavian Barnes | 2011-02-09 | 1 | -5/+1 |
| | |||||
* | Document libdimension with Doxygen. | Tavian Barnes | 2010-11-14 | 1 | -5/+12 |
| | |||||
* | Make DMNSN_PRTREE_B and internal types local to prtree.c. | Tavian Barnes | 2010-07-18 | 1 | -11/+1 |
| | |||||
* | New bounding box special constructors. | Tavian Barnes | 2010-06-06 | 1 | -0/+1 |
| | |||||
* | New dmnsn_prtree_inside() function, rename dmnsn_prtree_search(). | Tavian Barnes | 2010-06-06 | 1 | -2/+3 |
| | |||||
* | Store the bounding boxes of child PR-tree nodes in the parent. | Tavian Barnes | 2010-05-20 | 1 | -4/+4 |
| | | | | This improves cache locality and is good for about a 10% performance boost. | ||||
* | Don't store unbounded objects (planes, etc.) in the PR-tree. | Tavian Barnes | 2010-05-07 | 1 | -3/+8 |
| | | | | | Keep them in a dmnsn_array* instead. This makes the tree better and saves us some search time. | ||||
* | Replace BVSTs with priority R-trees. | Tavian Barnes | 2010-05-05 | 1 | -0/+51 |