Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

I'm looking for an algorithm to partition any simple closed polygon into convex sub-polygons--preferably as few as possible.

I know almost nothing about this subject, so I've been searching on Google Scholar and various computational geometry books, and I see a variety of different methods, some of which are extremely complicated (and meant to apply to non-simple polygons). I'm hoping there's a standard algorithm for this, with a clear explanation, but I don't know where to find it.

Can anyone point me to a source with a clear explanation of how to do this?

share|improve this question
1  
Triangulation is well-researched topic. For introduction see book by de Berg, Cheong, Kreveld Overmars. –  Boris Bukh Mar 31 '11 at 17:30

2 Answers 2

Chapter 2, Section 2.5 of Computational Geometry in C (1998), accessible via Google books, is on this topic: "Convex Partitioning." There are several choices here: (1) Triangulation, which always results in $n-2$ pieces for a polygon of $n$ vertices; (2) the Hertel-Mehlhorn algorithm, which is never worse than $2r+1$ pieces, where $r$ is the number of reflex vertices (which means it is never worse than four times the minimum); or (3) Chazelle's complex cubic algorithm that finds the minimum partition. The H-M algorithm is a happy medium in terms of both implementation difficulty (easy) and quality of result (not bad).
                Convex partition

There is a 4th choice if you insist that the corners of all your convex pieces are subsets of the polygon's vertices (unlike the example above). Then Green's (now) cubic dynamic programming algorithm achieves the minimum number of pieces.

Both Green's algorithm and the Hertel-Mehlhorn algorithm are implemented in CGAL; see the "2D Polygon Partitioning" section of the CGAL manual.

share|improve this answer

I don't know, whether this is an already known algorithm and I also don't know how optimal the resulting partioning will be, but its description and implementation are simple:

  • identify the set of inflex points, i.e. where a right-turn is made when going around the polygon counter clockwise

  • calculate the nested convex hull of the inflex point set

  • cut the polygon along the edges of the nested convex hull, that are inside the polygon

share|improve this answer
    
What is the nested convex hull? Does your algorithm handle correctly a polygon made of three concave parts (with only three non-inflex points)? –  Benoît Kloeckner Dec 14 at 16:54
    
@BenoîtKloeckner the nested convex hull is constructed by iteratively calculating the convex hull, then removing the points of the convex hull and then to calculate the convex hull of the remaining point set. So this is a set of nested convex polygons. The nested convex hull is also known as the iterated convex hull. –  Manfred Weis Dec 14 at 18:16
    
If I understand well, at each step you remove from the finite set of the previous step some of the points (those that are extremal in the convex hull, I guess). –  Benoît Kloeckner Dec 14 at 19:16
1  
This is called convex hull onion peeling. Too bad I cannot include an image in a comment, but: image. –  Joseph O'Rourke Dec 14 at 22:36

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.