I'm facing a problem while trying to write a code that'll give the vertices of the inner polygon if the Outer polygon's vertices are given along with the "setback values" of each face.↵
↵
![ ](https://s30.postimg.org/y2inv82g1/Polygon.png)↵
↵
↵
↵
in the example above, we'll be given the outer polygon vertices and the setback values a, b, c where a = distance from face A of the outer polygon to face A' of the inner polygon,↵
b = distance from face A of the outer polygon to face B' and so on... ↵
↵
↵
What's an optimal way to find the vertices of the inner polygon? ↵
↵
I tried to solve it but I'm unable to find the correct vertices while the slope value is > 0.↵
↵
The number of vertices will be from 1 to 100 and the area of the polygon will not exceed 10^6.↵
↵
Your help will be much appreciated :) ↵
↵
Thanks you
↵
![ ](https://s30.postimg.org/y2inv82g1/Polygon.png)↵
↵
↵
↵
in the example above, we'll be given the outer polygon vertices and the setback values a, b, c where a = distance from face A of the outer polygon to face A' of the inner polygon,↵
b = distance from face A of the outer polygon to face B' and so on... ↵
↵
↵
What's an optimal way to find the vertices of the inner polygon? ↵
↵
I tried to solve it but I'm unable to find the correct vertices while the slope value is > 0.↵
↵
The number of vertices will be from 1 to 100 and the area of the polygon will not exceed 10^6.↵
↵
Your help will be much appreciated :) ↵
↵
Thank