I have two linear rings, A (green) and B (red). I want to include all intersection points between two geometries in A.
In fact what I need is
(A-B)+(A.B) (or maybe just
A+(A.B)), but those operations may get too time consuming. The other option is to iterate over A's segments and find their intersections with B and construct a new linear ring from scratch. Now there might be many special cases that I need to cover. So, are there any other fast and robust options in NetTopologySuite?