论文信息 - Finding minimal enclosing boxes

Finding minimal enclosing boxes

The problem of finding minimal volume boxes circumscribing a given set of three-dimensional points is investigated. It is shown that it is not necessary for a minimum volume box to have any sides flush with a face of the convex hull of the set of points, which makes a naive search problematic. Nevertheless, it is proven that at least two adjacent box sides are flush with edges of the hull, and this characterization enables anO(n3) algorithm to find all minimal boxes for a set ofn points.

Joseph O'Rourke | J. O'Rourke

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

[2] Herbert Edelsbrunner,et al. Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane , 1985, Inf. Process. Lett..

[3] Dov Dori,et al. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition , 1983, Comput. Vis. Graph. Image Process..

[4] Frans C. A. Groen,et al. The smallest box around a package , 1981, Pattern Recognit..

[5] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[6] Alok Aggarwal,et al. An Optimal Algorithm for Finding Minimal Enclosing Triangles , 1986, J. Algorithms.

[7] G. Toussaint. Solving geometric problems with the rotating calipers , 1983 .

[8] Victor Klee,et al. Finding the Smallest Triangles Containing a Given Convex Polygon , 1985, J. Algorithms.

[9] Kenneth R. Sloan,et al. Analysis of ``Dot Product Space'' Shape Descriptions , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10] Chee-Keng Yap,et al. A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems , 1984, FOCS.