Excellent work. Would have given it 5 stars if it was able to handle overlap of two polygons within the same group. (Currently it does not color their intersection on the plot and gives the total area of both instead of the total area minus twice the intersection) Does anyone know if there is an easy way to handle this situation? I'm looking at the code, but not too confident that I'll be able to successfully edit it myself.
4
18 Mar 2014
Polygon_Intersection
This function computes n-times intersection region of shapes collection
Hi all,
I am interested in coloring the regions formed by a single self-intersecting polygon.
I was hoping that this would do it
%%
clear S
S(1).P.x = [0,5,5,2,2,4,4,1,1,3,3,0];
S(1).P.y = [0,0,5,5,2,2,1,1,3,3,4,4];
S(1).P.hole = 0;
Display_result = 1;
Accuracy = 1e-6;
Polygons_intersection(S,Display_result,Accuracy);
%%
However, using this function the region that is double-covered is not colored. Can the author (or anyone else) recommend an algorithm to accomplish a single coloring of all regions of N-covering?
Cheers, John
Comment only