15 years, 2 months ago
Highlights
15 years, 2 months ago
So if I got this right the process would be as follows: 1. loop through each line segment that makes up Polygon A, checking whether each segment intersects with Polygon B's…
15 years, 2 months ago
My problem is as follows. I have two convex polygons (polygon A, polygon B) represented by two sets of 3D vertices. A and B can have any number of sides as long as they remain c…
15 years, 2 months ago
First off, since you're working in 3D, the separating axis is actually a separating plane. I've been solving a similar problem very efficiently using the following metho…
15 years, 2 months ago
15 years, 2 months ago
Latest Activity
See all in DiscussionsSo if I got this right the process would be as follows: 1. loop through each line segment that makes …
15 years, 2 months ago
First off, since you're working in 3D, the separating axis is actually a separating plane. I've been solving a similar …
15 years, 2 months ago
IIRC SAT works fine for convex polygones. If they are not coplanar the Minkowski sum will be a convex polyhedron …
15 years, 2 months ago
Badges
Conversation Opener
Decade Member
5-Year Veteran
1-Year Veteran
Spotlight
Jack-of-Trades
View all badges →