I'm currently working on a little tool and one of its functions is to detect and beyond that eventually remove overlaps.

I am there fore using the hasOverlap() method like this:

if glyph.hasOverlap():
    print(glyph.name)
    glyph.markColor = 0.5, 0, 0.2, 0.75
    # and so on

This works quite reliable, with the exception, that it does not find the overlap in my /Y (my function to remove overlaps does not work either here since its depending on the outcome of the hasOverlap() function).

The built-in right-click context function to remove overlaps works however.

After some testing I found out, that it might be connected to the positioning of my outlines and points. As you can see the stem goes directly through the two points here.

If the outline is just moved by one unit and the outline does not go directly through both points the overlap is detected.
Am I missing something here, or is there another (or better) way to detect overlaps and to make my tool work?

TIA
daniel

I can confirm the false negative for this particular shape. it looks like you’ve found a bug in the overlap detection algorithm 🐞 thanks!

I’ll make a few more tests and create an issue in booleanOperations.

you can ‘cheat’ the bug by moving the angled segments a few units down and inward:

I'll keep an eye on the bug report too. Thanks for finding the additional cases where overlaps are not detected, this is quite helpful during the mastering process :)

f = CurrentFont()

for g in f:
    testglyph = g.copy()
    testglyph.removeOverlap()
    
    if len(g) != len(testglyph):
        g.mark = (0.5, 0, 0, 0.9)

(idea of @benedikt)

So far I had no complications with that method

It will return a boolean indicating if the glyph has overlaps. The check happens in similar way as your proposal. Only a bit faster :), as a booleanOperations.union takes a pointPen as argument, so you dont need to copy the whole glyph...

It's already kind of not too slowly but you have to combine the above + hasOverlap() method to find everything.

But less code and faster is always better :)

the latest beta release includes an improved hasOverlap() function which returns a bool instead of a list of overlap positions. please give a try… thanks!