You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I have a question regiards the degenerate triangles removal code from line 10349 to line 10377 . It appears this part of the code first creates a KDtree data structure, i.e., (VHACD::fm_createVertexIndex), and then indexs each vertices of the triangle mesh into the KDtree, i.e., getIndex(), and then remove the triangle if two vertices have the same KDtree index. The entire point of this section seems to be removing degenerate triangles with edge length smaller than some threshold. If that's the case, why not just compute the edge length of each triangle and then check the edge length instead? Using the KDtree here seems like an overkill. Am I missing something here?
The text was updated successfully, but these errors were encountered:
The main reason the input mesh is being reindexed isn't to find degenerate triangles but rather to remove duplicate vertices. The raycasting library is sensitive to that and will not work right if there are duplicates.
I have a question regiards the degenerate triangles removal code from line 10349 to line 10377 . It appears this part of the code first creates a KDtree data structure, i.e., (VHACD::fm_createVertexIndex), and then indexs each vertices of the triangle mesh into the KDtree, i.e., getIndex(), and then remove the triangle if two vertices have the same KDtree index. The entire point of this section seems to be removing degenerate triangles with edge length smaller than some threshold. If that's the case, why not just compute the edge length of each triangle and then check the edge length instead? Using the KDtree here seems like an overkill. Am I missing something here?
The text was updated successfully, but these errors were encountered: