summaryrefslogtreecommitdiffstats
path: root/libdimension/prtree.c
Commit message (Collapse)AuthorAgeFilesLines
* Fix license years.Tavian Barnes2011-02-171-1/+1
|
* Flatten the pre-order traversal of the PR-tree for better cache locality.Tavian Barnes2011-02-091-108/+127
|
* Fix constness for dmnsn_list_comparator_fn.Tavian Barnes2010-11-281-13/+25
|
* End sentences with periods.Tavian Barnes2010-11-151-1/+1
|
* Document libdimension with Doxygen.Tavian Barnes2010-11-141-12/+33
|
* Factor out transformation code from object callbacks.Tavian Barnes2010-11-061-4/+4
|
* Slight ray-AABB intersection test optimization.Tavian Barnes2010-11-021-1/+1
|
* Add dmnsn_free() to match dmnsn_malloc().Tavian Barnes2010-09-261-3/+3
|
* Optimize PR-tree construction a bit.Tavian Barnes2010-08-011-7/+5
|
* Fix PR-tree implementation.Tavian Barnes2010-08-011-13/+14
| | | | Grab priority leaves all at once instead of round-robin.
* Fix some -W{strict,missing}-prototypes warnings.Tavian Barnes2010-07-311-1/+1
|
* Move test outside of loop in dmnsn_prtree_intersection_recursive().Tavian Barnes2010-07-201-7/+13
|
* Make DMNSN_PRTREE_B and internal types local to prtree.c.Tavian Barnes2010-07-181-1/+13
|
* Remove degeneracy test from ray-box intersections.Tavian Barnes2010-07-181-17/+25
| | | | | To avoid testing degenerate boxes, set prtree->root to NULL when the tree contains no bounded objects.
* Add descriptive comment to new branchless ray-AABB intersection tests.Tavian Barnes2010-07-151-0/+9
|
* Remove some unneeded tests from ray-AABB intersection tests.Tavian Barnes2010-07-151-43/+28
|
* Clean up optimized ray-AABB intersection code a bit.Tavian Barnes2010-07-151-21/+29
|
* Precalculate 1.0/ray.n.{x,y,z} for ray-box intersection tests.Tavian Barnes2010-07-141-12/+17
| | | | This saves us nearly a factor of 2, and I feel silly for not doing this before.
* Rename dimension_impl.h to dimension-impl.h.Tavian Barnes2010-07-141-1/+1
|
* Save some degeneracy tests in ray-AABB intersection tests.Tavian Barnes2010-07-091-16/+14
|
* Make dmnsn_ray_box_intersection() return false for zero boxes.Tavian Barnes2010-07-031-3/+3
|
* New dmnsn_bounding_box_is_infinite() predicate.Tavian Barnes2010-06-061-1/+1
|
* Don't use an anonymous union in prtree.c.Tavian Barnes2010-06-061-25/+25
|
* New bounding box special constructors.Tavian Barnes2010-06-061-28/+14
|
* New dmnsn_prtree_inside() function, rename dmnsn_prtree_search().Tavian Barnes2010-06-061-6/+46
|
* Add children to dmnsn_objects, which enables splitting unions.Tavian Barnes2010-06-051-1/+25
| | | | Also, use PR-trees for unions internally.
* Precompute objects in dmnsn_raytrace_scene() rather than dmnsn_new_prtree().Tavian Barnes2010-05-301-11/+0
|
* Slight prtree search optimization.Tavian Barnes2010-05-291-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 Barnes2010-05-201-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 Barnes2010-05-101-2/+2
|
* New DMNSN_ARRAY_FOREACH() macro, faster than iterating with dmnsn_array_get().Tavian Barnes2010-05-081-9/+4
|
* Handle degenerate cases in ray/box intersections.Tavian Barnes2010-05-081-1/+10
|
* Fix argument to malloc().Tavian Barnes2010-05-071-1/+1
|
* Don't store unbounded objects (planes, etc.) in the PR-tree.Tavian Barnes2010-05-071-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 Barnes2010-05-051-15/+11
|
* Optimize ray-AABB intersection tests a bit.Tavian Barnes2010-05-051-51/+29
|
* Make dmnsn_new_prtree() handle empty scenes.Tavian Barnes2010-05-051-0/+6
|
* Replace BVSTs with priority R-trees.Tavian Barnes2010-05-051-0/+574
generated by cgit v1.2.3 (git 2.39.1) at 2024-11-18 08:05:19 +0000