Largest inscribed rectangle in a polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is solved for convex polygons [2] in 2016, and there is a heuristic algorithm for non-convex polygons [4] in 2018. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. Comparing with stare of the art, the rectangles resulted from our algorithm have bigger area. We also proposed an approach to use the algorithm for finding a rectangle with general direction.