Algorithm for partitioning a general closed polygon

Question

0.00/5 (No votes)

See more:

Can I get some pointers to readable literature on how to partition
a general polygon into montone chains. I am trying to use the gpc library for polygon clipping which generates minimas which are far too too (yes twice over) many - something is funny.

Posted 18-Jan-11 0:29am

Shunya

Updated 18-Jan-11 1:28am

#realJSOP

v2

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

#realJSOP · Answer 1 · 2011-01-18T01:30:00

Solution 1

Did you even think about using google? Search for "partition polygon into monotone chains" and you'll get 22,000 results. Surely, one of those has to be "readable".

Posted 18-Jan-11 1:30am

#realJSOP

Comments

CPallini 18-Jan-11 8:14am

[Carlo on behalf of Shunya]
I did before posting the query.
I also have a solution code (from clipper )which generates minimas.
I am looking for literature ..not code... especially for definitions of "minima" nodes.