Divide self intersecting polygon (C Code)

问题

I want to divide a self-intersecting polygon into simple polygons. I have the edges and the intersection points saved in a data structure (a connected list).

So here is an example. I have a connected list with the x,y coordinates of the edges and the intersection points of the polygon. According to the polygon in this picture it would be :: (1) -> (2) -> (3) ... -> (7). What I'm trying to do is to get the edges of the simple polygons (triangles here). In this case :: 1,2,7 / 3,4,5 / 5,6,7.

回答1:

I would think that Bentley-Ottman would be your best bet. There's a nice interactive visualization here. Another nice description here.

来源：https://stackoverflow.com/questions/4115853/divide-self-intersecting-polygon-c-code