Computational Geometry – Constructing an Inverted No-Fit Polygon

I need a robust algorithm to optimally fit a non-convex polygon to another. The destination may contain holes.

Recently, I found scientific articles on this topic:

One of them describes how to match one list of polygons to another. Building a polygon without adjustment here is mentioned as one of the steps.

Another describes a robust and concrete way of building a polygon without adjustment with good complexity.

The only problem I have is that in this paper different things are considered unadjusted polygons.
In the first case, it is inside the polygon, while in the second, it looks like another outside and has a different meaning.

I understand that the notion of "non-adjustment-polygon" is described in the second article, but how can I be "inverted", as in the first picture? Maybe it is possible to adjust the algorithm from the second article for this case?

I would also like the solution to be implementable in the code.

Any help appreciated.