c++ - Is there a well known algorithm to find self-overlaps within a tolerance distance for linestrings/polygonal chains? -

in following example, taking following linestring input, 2 sub-linestrings output i’m interested in 2 parts between c/d, cutting lines.

it's trivially easy between 2 distinct linestrings, within same 1 harder. known problem/is there obvious approach missing ?