Archived

This topic is now archived and is closed to further replies.

Gelmir

convex space test

Recommended Posts

Hi everybody! Does anyone where I can find an algorithm to test if a set of polygons form a convex subspace? It is for construct a BSP tree. The idea is to stop the recursion where the list of polygons of a node make a convex sector. Thanx!!!

Share this post


Link to post
Share on other sites
Here''s the definition of convex I know: An area is convex if, when lines are drawn from each vertex to every other vertex, those lines never pass outside the area. You should be able to go from there.

Share this post


Link to post
Share on other sites
for a mesh, just go through every face and check if all the vertices are on ONE side of the face plane.... that should do it :O)

cya,
Phil


Visit Rarebyte!
and no!, there are NO kangaroos in Austria (I got this questions a few times over in the states

Share this post


Link to post
Share on other sites