Comments by Amos Chew (Top 3 by date)

i've tried storing the triangles into an octree and then test for intersection between a particular triangle and a query box....BUT that is only for triangles that are smaller than the query box....what IF the triangle size is larger than the query box (does not contain any of the vertices but still intersects with the triangle)...?

slower way as in the standard brute force of testing every single triangle for intersection with bounding box....a quicker way as in is it possible to select the nearest triangle to the bounding box n perform the intersection test...