Breaking down the No Fit Polygon concept

I am writting a new program where I need to find the optimal position between 2 polygons.

This means to have both P1 and P2 polygon touching each other without actually intersecting each other.

I know that the No Fit Polygon is the solution I want to use, I just don't know how to write it in VB or C++

P1 and P2 can be convex or non convex polygon as the shape of both polygons is not relevant.

Thank you for your help

Have you got any further.

I'm looking for a calculation to fit any two polygons into the smallest possible rectangle.