Finding minimal enclosing boxes

H. Freeman and R. Shapira, Determining the Minimum-area Encasing Rectangle for an Arbitrary Closed Curve,Commun. of the ACM,18:409?413 (July 1975).

F. C. A. Groen, P. W. Verbeek, N. de Jong, and J. W. Klumper, The Smallest Box Around a Package,Pattern Recognition,14(1?6):173?178 (1981).

K. R. Sloan, Jr., Analysis of ?Dot Product Space? Shape Descriptions,IEEE Trans. on Pattern Analysis and Machine Intelligence,PAMI-4(1):87?90 (January 1982).

G. T. Toussaint, Solving Geometric Problems with the ?Rotating Calipers,?Proc. of IEEE MELECON 83, Athens, Greece (May 1983).

V. Klee and M. L. Laskowski, Finding the Smallest Triangles Containing a Given Convex Polygon,J. Algorithms,6:457?464 (1985).

J. O'Rourke, A. Aggarwal, S. Maddila, and M. Baldwin, An Optimal Algorithm for Finding Minimal Enclosing Triangles,J. Algorithms, to appear (1986).

J. S. Chang and C. K. Yap, A Polynomial Solution for Potato-peeling and Other Polygon Inclusion and Enclosure Problems,Proc. of Foundations of Comput. Sci., pp. 408?416 (October 1984).

F. P. Preparata and S. J. Hong, Convex Hulls of Finite Sets of Points in Two and Three Dimensions,Commun. of the ACM,20:87?93 (October 1977).

G. T. Toussaint, Pattern Recognition and Geometric Complexity,Proc. 5th Inter. Conf. on Pattern Recognition, Miami Beach, p. 1324?1347 (December 1980).

H. Edelsbrunner and H. Mauer, Finding Extreme Points in Three Dimensions and Solving the Post-office Problem in the Plane,Info. Proc. Letters,21:39?47 (1985).

D. Dori and M. Ben-Bassat, Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition, Comp. Vision, Graphics, and Image Processing,24:131?159 (1983).