Algorithm – thousands of lights with triangles in 3D space

By Mathematics

There are thousands of rays and triangles. We need to get all the intersections. If we use a normal two-level loop, we need O(mn) time complexity. Is there How to reduce the time complexity from O(mn) to O(m * logn) or O(logm * n)?

Best wishes,

You may want to watch Is some kind of spatial partitioning technique. This allows you to quickly exclude the set of triangles.

I might consider some methods of using spherical Bounding Volume Hierarchies. But other techniques you might want to check out are BSP (Binary Space Partitioning) Trees/KD Trees or use Octree

There are thousands of rays and triangles. We need to get all the intersection points. If we use normal For the two-level loop, we need O(mn) time complexity. Is there a way to reduce the time complexity from O(mn) to O(m * logn) or O(logm * n)?

Best wishes,

What you might want to see is some kind of space partitioning technology. This allows you to quickly Exclude the set of triangles.

I might consider some methods of using spherical Bounding Volume Hierarchies. But other techniques you might also want to check out are BSP (Binary Space Partitioning) Trees/KD Trees or use Octree

, , , , , , ,

WordPress database error: [Table 'yf99682.wp_s6mz6tyggq_comments' doesn't exist]
SELECT SQL_CALC_FOUND_ROWS wp_s6mz6tyggq_comments.comment_ID FROM wp_s6mz6tyggq_comments WHERE ( comment_approved = '1' ) AND comment_post_ID = 5297 ORDER BY wp_s6mz6tyggq_comments.comment_date_gmt ASC, wp_s6mz6tyggq_comments.comment_ID ASC

Leave a Comment

Your email address will not be published.