Hello,
One possibility which gives an exact result and has
the complexity of O(n*log(n)) where n is the number of
vertices (edges) in the polygon would be to use
Green's theorem. One consequence of it is that id D is
a 2 dimensional region which boundary is a simple (and
piecewise continuously dif
R-listers,
Given a polygon and a circle defined by its center coordinates and a
radius, I would like to calculate the area of overlap. I know that I
can create a polygon from the circle and then use available packages to
get the area of the intersection. However, because the polygon is of a
2 matches
Mail list logo
