Original Post
Hi!
I''m building a portal engine and one of the problems is to calculate a polygon witch is the intersection of two 2d convex polygons.
My engine only does square polygons right now and it works, but how do i do it whith n sided polygons (without dividing them into triangles).
thks!