# Voronoi regions of a (convex) polygon

I'm looking to add circle-polygon collisions to my Separating Axis Theorem collision detection.

The metanet software tutorial (http://www.metanetsoftware.com/technique/tutorialA.html#section3) on SAT, which I discovered in the answer to a question I found when searching, talks about voronoi regions.

I'm having trouble finding material on how I would calculate these regions for an arbitrary convex polygon and also how I would determine if a point is in one + which.

The tutorial does contain source code but it's a .fla and I don't have Flash unfortunately.

• Two books, Graphics Gems IV and Numerical Recipes, provide good discussion as well as source code. I recommend either. – Throwback1986 Feb 13 '11 at 5:37
• What do you want to compute? Voronoi diagram or circle - convex polygon intersection test? What do you need to compute? Just bool (intersect x not intersect) or something more presice (points of intersection)? – zacharmarz Feb 13 '11 at 12:16
• @ashes999 A .fla is not a compiled Flash-File. It's a source-file for the Flash IDE. The compiled files are .swf or .swc files. – bummzack Jan 24 '13 at 20:19