I have an input, a set of different types of 2D geometrical elements with all its attributes (arcs, circles, lines, polylines, rectangles, polygons..). These elements can be connected end to end, overlapping, intersecting.
I want to extract all possible polygons formed from this set of elements, including the outermost polygons which can be a superset of inner polygons. (I need to integrate this in a C# .Net application, where I will extract all polygons and be able to give Color-Fill to any of those polygons)
I need to extract all the inner (green) and outer(red) polygons.
I would like to know if there is an existing implementation available for this. Or if any combination of existing solutions would provide a required output.
If there are no solutions available, how could I develop a solution?