Hi,

I'm wondering if it already exists an algorithm that would be able to

rebuild a polygon that intersect itself into a polygon that doesn't

intersect itself.

Example:

A) C

+

/ \

/ \

A +---+-----+ B

| /

| /

|/

+

D

B) C

+

/ \

/ \

A +---+-----+ B

| /

| /

|/

+

D

Instead of a polygon that intersect itself, I've got a polygon that

doesn't intersect itself. The polygon A has the following sequence:

A,B,C,D compares to the resulting one who has: A,C,B,D.

So, I would like to found an algorithm which is able to do this kind of

operation.

Any suggestion will be appreciated!

Thanks!

\\\|///

\\ - - //

----------------------oOOo-(_)-oOOo-------------------------------

Jocelyn Denis | _/ _/_/_/ _/_/_/

Analyste programmeur | _/ _/ _/

Programmer Analyst | _/ _/_/_/ _/

http://www.lsc.ca | _/_/_/ _/_/_/ _/_/_/ 2+1 INC.

------------------------------Oooo--------------------------------

oooO ( )

( ) ) /

\ ( (_/

\_)