Find nearest triangle to a point (not ray)
Forum Reply
14 years, 1 month ago
Highlights
Community contributions featuredA KD tree is a good choice. Just recurse down the tree as follows: If the node is a leaf, just scan over the triangles and find the closest one. Return the index of the triangle…
14 years, 1 month ago
14 years, 5 months ago
I said you recurse on the two subtrees, but actually no recursion is necessary when building the tree, since you know in advance which regions you will have to sort at each leve…
14 years, 5 months ago
14 years, 5 months ago
14 years, 5 months ago
Latest Activity
See all in DiscussionsA KD tree is a good choice. Just recurse down the tree as follows: If the node is a leaf, …
14 years, 1 month ago
I said you recurse on the two subtrees, but actually no recursion is necessary when building the tree, since you …
14 years, 5 months ago
I'm not really familiar with OpenCL, but in my implementation I just sorted all the photons along one axis (say …
14 years, 5 months ago
Badges
Contributor
Decade Member
5-Year Veteran
Visionary
Rare
1-Year Veteran
Spotlight
First Steps
Conversationalist
Rare
View all badges →