论文信息 - A Linear Time Algorithm for the Minimum Area Rectangle Enclosing a Convex Polygon - 字舞流文

A Linear Time Algorithm for the Minimum Area Rectangle Enclosing a Convex Polygon

We give an 0 (n) algorithm for constructing the rectangle of minimum area enclosing an n-vcrtex convex polygon.

Dennis S. Arnon | John P. Gieselmann

[1] Antonio Albano,et al. A Two-stage Solution of the Cutting-stock Problem , 1971, IFIP Congress.

[2] Herbert Freeman,et al. Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[3] Jack Sklansky,et al. Finding the convex hull of a simple polygon , 1982, Pattern Recognit. Lett..

[4] Herbert Freeman,et al. A Multistage Solution of the Template-Layout Problem , 1970, IEEE Trans. Syst. Sci. Cybern..