Determining the Minimum-Area Encasing Rectangle for an Arbitrary Closed Curve

Communications of the ACM

Volumn 18, Issue 7, 1975, Pages 409-413

  Freeman, H ^a   Shapira, R ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

enclosed curve; minimum area encasing rectangle; optimum layout; optimum packing

Indexed keywords

OPTIMIZATION;

EID: 0016534815     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/360881.360919     Document Type: Article

References (7)

1. Haims, M.J., and Freeman, H. A multistage solution of the template-layout problem. IEEE Trans. Syst. Science and Cybernetics SSC-6, 2 (Apr. 1970), 145-151.
2. Adamowicz, M., and Albano, A. A two-stage solution of the cutting stock problem. Information Processing 71 Proc. IFIP Cong. 71, North Holland Pub. Co., Amsterdam, 1972, pp. 1086-1091.
3. Eastman, C.M. Heuristic algorithms for automated space planning. Proc. 2nd Int'l. Conf. on Artif. Intell., British Computer Society, 29 Partland Place, London, 1971, pp. 27-39.
4. Freeman, H. On the encoding of arbitrary geometric configurations, IRE Trans. EC-10, 2 (June 1961), 260-268.
5. Freeman, H. Boundary encoding and processing. In Picture Processing and Psychopictorics, B. Lipkin and A. Rosenfeld (Eds). Academic Press, New York, 1970.
6. Ramer, E.U. An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing 1, 3 (Nov. 1972), 244-256.
7. Freeman, H. Computer processing of line-drawing images. Computing Surveys 6, 1 (Mar. 1974), 57-97.