search

dilevin / computer-graphics-bounding-volume-hierarchy

Computer Graphics Assignment about Bounding Volume Hierarchies
6 stars 5 forks source link

Is it possible to post the tutorial slide early so that we can start early? #63

Open junior-stack opened 9 months ago

junior-stack commented 9 months ago

As title ^

Zhecheng-Wang commented 9 months ago

Hi, there wasn't a tutorial slide for Wednesday's tutorial as we were going over the contents missed from Monday's lecture. We covered Distance queries and Intersection queries between two trees.

However, I did give a few suggestions on the order of implementation at the end.

I would suggest starting with ray_intersect_....cpp, box_box_intersect.cpp and ..._brute_force.cpp. To implement AABBTree, you need insert_box_into_box.cpp and insert_triangle_into_box.cpp. Then point_AABBTree_squared_distance.cpp and find_all_intersecting_pairs_using_AABBTrees.cpp build on top of that, and algorithms are in README.

Similar to the point-AABB distance query, AABBTree_ray_intersect.cpp can be implemented as a traverse down the AABB tree while keeping track of t and descendant.