Subdivision of convex polygons.

[judgex]

I would like a method of subdividing a convex polygon into two or more smaller polygons so that:

1. Each polygon in the result is convex.
2. The number of polygons in the result is at a minimum.
3. No edge of the original polygon is split.
4. The area of each polygon in the result is at a maximum.

I would also be interested in the same method with the last condition removed (i.e., area not important).

Any feedback on how methods like these can be found or constructed is appreciated.

[Elementer]

Hello,
what do you mean !? With 2 or more polygons do you mean you want triangulate a convex polygon ? If yes, it's simple, with a convex polygons with "n" vertices (n > 3) you can take the first three and create a triangle with them. (You can can recursively repeat the step to divide the triangle to small ones). Repeat the step until you have processed all vertices. This is a simple base algorithm to triangulate a convex polygon.

Bye

[andytim]

Hi,
This is a much complex problem,maybe you need use some third party kit to solve this problem,XD++ MFC Library is a choice,you can try and download it from here: http://www.********.net
Andy

[aredo]

Hi,
This is a much complex problem,maybe you need use some third party kit to solve this problem,XD++ MFC Library is a choice,you can try and download it from here: http://www.********.net
Andy

Do board moderators allow advertising inside threads like you do ? I'm just wondering...

[cmiskow]

If the result should be the least number of sub-polygons with the largest area, it seems to me the answer will always be 2 sub-polygons. Then you just have to find an algorithm to find the new edge between 2 vertices that will yield the largest area for the new polygons.