Subdividing a general polygon in a number of small convex polygons

Question

I have a polygon P made of N vertices. I need an algorithm that, given P, subdivide it in a certain number of convex polygons each using at most M vertices.

Ps. P is a 2D polygon. Furthermore, i can use a polygon triangulation, but i am interested in algorithms that subdivide P into convex polygons having more than 3 vertices (and, as said above, at most M).

Why not do something similar to triangulation, but only draw a line from the inner point to every Mth vertex? — bmm6o, Feb 27 '12 at 17:15

duffymo · Answer 1 · 2012-02-27T17:04:42.467

0

Quadtree methods would be my recommendation. Check those out.

edited Feb 27 '12 at 17:04

answered Feb 27 '12 at 16:31

duffymo

305,152
44
369
561

I can't see how i should use a quad-tree to subdivide my polygon. Could you explain better your idea? Thanks. – Marco Masci Feb 27 '12 at 16:59
It's not a data structure; it's an automatic meshing algorithm. – duffymo Feb 27 '12 at 17:04

Subdividing a general polygon in a number of small convex polygons

1 Answers1