It is necessary to solve the following problem: there are one or more arbitrary n-gon(may not be convex), which intersect with the circle. You need to find the percentage of overlapping n-gons circle. Coordinates of all points of the n-gon and center coordinates of a circle and its radius are known. For clarity, the screenshot is attached.
Me the necessary mathematical apparatus for this task. It is possible in English. In principle, the implementation of YAP.
How to solve the problem of intersection of n-triangles to each other I know. But with no circumference. Thanks in advance.