Open jjackzhu opened 1 month ago
I think the brute force is too fast (we expect brute force time >>> tree time). Something definitely went wrong there.
as i said in the post, this was outputted using only 10 points and 10 query points as a test, so i expect brute force to be pretty fast. Otherwise using 100000 points and 10000 queries, brute force takes a long time and the code outputs the same result (a single empty box). ./rays and ./intersections both seem to output the correct result. Looking at visualize_aabbtree, I also dont really see how brute force affects whether or not the points are displayed in the viewer, even if there was an error with it
I checked to see if P actually contained any points before being sent to visualize_aabbtree, and the points are there, just not being displayed? so i am not sure how to debug this, or if this is just a problem that exists only on my end
My code for ./distances seems to run just fine (no errors outputted), and the box is displayed but no points show up. (output from using 10 points and 10 query points)
I can change the depth and see the smaller boxes, but nothing else.