Boolean General Fuse Implementation

[paulbuechner]

Hey NTS Community,

I'm trying to achieve an OpenCASCADE-like Boolean General Fuse.

To explain what I mean, take a look at the following images.

Given Polygon 1 with:

POLYGON ((37.1310074 13.6, 6.7 13.6, 6.7 -13.6, 37.1327306 -13.6, 37.226843314423661 -13.041920076424583, 37.317009407054428 -12.483188942645704, 37.403224373985225 -11.923834507970106, 37.4854839086725 -11.36388471283918, 37.563783902151364 -10.803367527433293, 37.638120443240986 -10.242310950274655, 37.70848981873975 -9.6807430068287648, 37.77488851361089 -9.1186917481044869, 37.837313211157962 -8.5561852492528878, 37.895760793190654 -7.9932516081648215, 37.950228340180416 -7.4299189440674445, 38.000713131406343 -6.8662153961195811, 38.047212645091072 -6.3021691220061733, 38.08972455852674 -5.7378082965317505, 38.128246748191025 -5.1731611102130737, 38.162777289853246 -4.6082557678709728, 38.193314458670386 -4.0431204872214916, 38.219856729273332 -3.4777834974663819, 38.24240277584309 -2.912273037883, 38.260951472176892 -2.3466173564137462, 38.275501891744554 -1.7808447082550192, 38.286053307734761 -1.2149833544458615, 38.292605193091312 -0.64906156045626273, 38.29515722053948 -0.083107594775274365, 38.293709262602363 0.48285027250103107, 38.288261391607243 1.0487837710816947, 38.278813879681955 1.6146646318930089, 38.265367198741338 2.1804645884905804, 38.247922020463633 2.7461553784712796, 38.226479216256919 3.311708744884998, 38.20103985721564 3.8770964376460779, 38.171605214067036 4.4422902149444887, 38.138176757107665 5.0072618446565045, 38.100756156130096 5.5719831057549385, 38.059345280339272 6.1364257897188343, 38.013946198259376 6.7005617019425081, 37.96456117763033 7.2643626631438876, 37.911192685294573 7.8278005107721258, 37.853843387073923 8.39084710041434, 37.792516147636285 8.9534743072014749, 37.727214030352613 9.5156540272131469, 37.657940297143938 10.077358178881498, 37.58469840831836 10.638558704393896, 37.507492022398218 11.199227571094454, 37.426324995937364 11.759336772884279, 37.341201383328546 12.318858331620445, 37.252125436600764 12.877764298513526, 37.159101605207077 13.436026755523633, 37.1310074 13.6))

And Polygon 2 with:

POLYGON ((37.131007 13.6, 37.225190461478931 13.041932006825913, 37.315427383717044 12.483212303140336, 37.401713259269172 11.923868797679059, 37.484043778049823 11.363929430337546, 37.562414827548409 10.803422170775281, 37.6368224930347 10.242375017018675, 37.707263057754339 9.6808159940625114, 37.773733003114565 9.11877315247006, 37.836229008859945 8.5562745669719487, 37.84226 8.5, 6.7 8.5, 6.7 13.6, 37.131007 13.6))

I want a result that "Fuses" / "Unions" the inputs so it contains all edges (no duplicates) resulting from the intersection. I played around with Union and Noding API, but wasn't able to come up with a solution yet myself. It should look something like the following, but with a proper union result for the intersecting part with no duplicates.

At the end, I want to be able to feed the resulting edges into a Polygonizer to retrieve 2 "faces".

@FObermaier, I saw that you are quite active in here. I would really appreciate you guiding me in the right direction.

[paulbuechner]

I was able to implement the desired behavior by having a closer look at what it means to use primitives like Polygon vs. MultiLineString and how this affected my results. I also applied snapping to my geometries to handle self-intersections better.