%0 Journal Article %T Algorithm for finding the largest inscribed rectangle in polygon %J Journal of Algorithms and Computation %I University of Tehran %Z 2476-2776 %A Marzeh, Zahraa %A Tahmasbi, Maryam %A Mirehi, Narges %D 2019 %\ 06/01/2019 %V 51 %N 1 %P 29-41 %! Algorithm for finding the largest inscribed rectangle in polygon %K non-convex polygon %K IIC %K inscribed rectangle %K longest path %K largest cycle %R 10.22059/jac.2019.71280 %X 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. %U https://jac.ut.ac.ir/article_71280_2a21de484e568a9e396458a5930ca06a.pdf