From 22063dbca99c78452521d4d8f266023a6a935bac Mon Sep 17 00:00:00 2001 From: Finn Bear Date: Tue, 14 Jan 2025 17:10:11 -0800 Subject: [PATCH] Update CHANGELOG.md Co-authored-by: Sven-Hendrik Haase --- CHANGELOG.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/CHANGELOG.md b/CHANGELOG.md index 3cf0afd..89ecbf3 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -12,9 +12,9 @@ and this project adheres to [Semantic Versioning](http://semver.org/). need to change it to `BvhTraverseIterator`. [#128](https://github.com/svenstaro/bvh/pull/128) (thanks @finnbear) - **Breaking change:** `Ray::intersection_slice_for_aabb` now returns `None` instead of `(-1.0, -1.0)` in the case of no intersection, and `Some((entry, exit))` in the case of intersection. [#133](https://github.com/svenstaro/bvh/pull/133) [#142](https://github.com/svenstaro/bvh/pull/142) (thanks @finnbear) -- `Bvh::{nearest, farthest}_traverse_iterator` now output correctly ordered results when the children +- `Bvh::nearest_traverse_iterator` and `Bvh::farthest_traverse_iterator` now output correctly ordered results when the children of an internal node overlap, resulting in them taking more time and requiring heap allocation. - The new `Bvh::{nearest, farthest}_child_traverse_iterator` use the old algorithm. [#133](https://github.com/svenstaro/bvh/pull/139) (thanks @dashedman) + The new iterators `Bvh::nearest_child_traverse_iterator` and `Bvh::farthest_child_traverse_iterator` use the old algorithm. [#133](https://github.com/svenstaro/bvh/pull/139) (thanks @dashedman) - Fix panic on empty `DistanceTraverseIterator` [#117](https://github.com/svenstaro/bvh/pull/117) (thanks @finnbear) - Fix center() for very large AABBs [#118](https://github.com/svenstaro/bvh/pull/118) (thanks @finnbear) - Fix more cases where an empty BVH would panic [#116](https://github.com/svenstaro/bvh/pull/116) (thanks @finnbear)