Access Restriction

Author Shapira, R. ♦ Freeman, H.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Optimum packing ♦ Minimum-area encasing rectangle ♦ Optimum layout ♦ Enclosed curve
Abstract This paper describes a method for finding the rectangle of minimum area in which a given arbitrary plane curve can be contained. The method is of interest in certain packing and optimum layout problems. It consists of first determining the minimal-perimeter convex polygon that encloses the given curve and then selecting the rectangle of minimum area capable of containing this polygon. Three theorems are introduced to show that one side of the minimum-area rectangle must be collinear with an edge of the enclosed polygon and that the minimum-area encasing rectangle for the convex polygon is also the minimum-area rectangle for the curve.
Description Affiliation: New York Univ., New York, NY (Freeman, H.; Shapira, R.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 18
Issue Number 7
Page Count 5
Starting Page 409
Ending Page 413

Open content in new tab

   Open content in new tab
Source: ACM Digital Library