Algorithm for finding the largest inscribed rectangle in polygon

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Marzeh Zahraa; TAHMASBI MARYAM; Mirehi Narges

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ALGORITHMS AND COMPUTATION Year:2019 | Volume:51 | Issue:1 Page(s): 29-41

Download Full-Text

View:

260

Download:

527

Cites:

Information Journal Paper

Title

Algorithm for finding the largest inscribed rectangle in polygon

Author(s)

Marzeh Zahraa | TAHMASBI MARYAM | Mirehi Narges | Issue Writer Certificate

Keywords

non-convex polygon

IIC

inscribed rectangle

longest path

largest cycle

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 finding a rectangle with general direction.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Marzeh, Zahraa, TAHMASBI, MARYAM, & Mirehi, Narges. (2019). Algorithm for finding the largest inscribed rectangle in polygon. JOURNAL OF ALGORITHMS AND COMPUTATION, 51(1), 29-41. SID. https://sid.ir/paper/354571/en

Vancouver: Copy

Marzeh Zahraa, TAHMASBI MARYAM, Mirehi Narges. Algorithm for finding the largest inscribed rectangle in polygon. JOURNAL OF ALGORITHMS AND COMPUTATION[Internet]. 2019;51(1):29-41. Available from: https://sid.ir/paper/354571/en

IEEE: Copy

Zahraa Marzeh, MARYAM TAHMASBI, and Narges Mirehi, “Algorithm for finding the largest inscribed rectangle in polygon,” JOURNAL OF ALGORITHMS AND COMPUTATION, vol. 51, no. 1, pp. 29–41, 2019, [Online]. Available: https://sid.ir/paper/354571/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops