Algorithm for finding the largest inscribed rectangle in polygon

	Algorithm for finding the largest inscribed rectangle in polygon
Journal of Algorithms and Computation
مقاله 3، دوره 51، شماره 1، شهریور 2019، صفحه 29-41 اصل مقاله (1.86 M)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2019.71280
نویسندگان
Zahraa Marzeh؛ Maryam Tahmasbi^* ؛ Narges Mirehi
Department of computer science, Shahid Beheshti University, G.C., Tehran, Iran.
چکیده
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.
کلیدواژه‌ها
non-convex polygon؛ IIC؛ inscribed rectangle؛ longest path؛ largest cycle

آمار تعداد مشاهده مقاله: 1,746 تعداد دریافت فایل اصل مقاله: 14,167

سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب