I’m late…
Here a possible iterative solution with the good old Anemone
rectangles_V2.gh (16.5 KB)
Works only with orthogonal profile, counterclockwise orientation.
It move the shortest segment by X towards the inside the profile, where X is the shortest length of the 2 adjacent segments.
The shortest segment must be an “external” one, I’ve used some extended point inclusion test to determine this.
That’s it, looping the iteration up to the end (increase iteration count if needed).
Surprisingly neat!