Title of article
Algorithm for nding the largest inscribed rectangle in polygon
Author/Authors
Marzeh, Zahraa Department of computer science - Shahid Beheshti University, Tehran , Tahmasbi, Maryam Department of computer science - Shahid Beheshti University, Tehran , Mirehi, Narges Department of computer science - Shahid Beheshti University, Tehran
Pages
13
From page
29
To page
41
Abstract
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 nding 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 nding a rectangle
with general direction.
Keywords
non-convex polygon , IIC , inscribed rectangle , longest path , largest cycle
Journal title
Astroparticle Physics
Serial Year
2019
Record number
2469342
Link To Document