In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. 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.
Marzeh, Z., Tahmasbi, M., & Mirehi, N. (2019). Algorithm for finding the largest inscribed rectangle in polygon. Journal of Algorithms and Computation, 51(1), 29-41. doi: 10.22059/jac.2019.71280
MLA
Zahraa Marzeh; Maryam Tahmasbi; Narges Mirehi. "Algorithm for finding the largest inscribed rectangle in polygon". Journal of Algorithms and Computation, 51, 1, 2019, 29-41. doi: 10.22059/jac.2019.71280
HARVARD
Marzeh, Z., Tahmasbi, M., Mirehi, N. (2019). 'Algorithm for finding the largest inscribed rectangle in polygon', Journal of Algorithms and Computation, 51(1), pp. 29-41. doi: 10.22059/jac.2019.71280
VANCOUVER
Marzeh, Z., Tahmasbi, M., Mirehi, N. Algorithm for finding the largest inscribed rectangle in polygon. Journal of Algorithms and Computation, 2019; 51(1): 29-41. doi: 10.22059/jac.2019.71280
)