How find all inner diagonals of the non-convex and simple polygon in O(N*N) and better. My solution consisting of two steps
A] throw all intersecting diagonals: test if diagonal intersects any edge of the polygon
b] test, if diagonal is inner/or outer
was slow... Is there any faster solution? Thanks fof your help...