Citation: | Qinghua Li, Guangming Dai, Maocai Wang. Research on Algorithm for Generating Min-Area Rectangle Encasing Box for Closed Contour. Journal of Earth Science, 2003, 14(4): 381-384. |
In many engineering applications, it is necessary to calculate the min-area encasing box of a circumscription.In this paper, an algorithm for generating the min-area rectangle encasing box, based on revolving angle, is investigated and hence put forward.The algorithm computes the areas of the outer rectangular bounds of a closed contour in different revolving angles θby dispersing approach where 0 <
Day A M, 1988. Planar Convex Hull Algorithms in Theory and Practice. Compute Graph Forum, 7: 177 -193 |
Freeman H, Shapira P, 1975. Determining the M inimum Area Encasing Rectangle for an Arbitrary Closed Curve. Communication ACM, 18(7) : 409-420 |
Martin P R, Stephson P C, 1988. Putting Objects into Boxes. Computer Aided Design, 20(9) : 506 -521 doi: 10.1016/0010-4485(88)90040-1 |
Preprata F P, Shamos M I, 1985. Computational Geometry -An Introduction. New York: Springer-Verlag |
Yang X N, Wang G, 1999. Accelerating Algorithm for 3D Convex Hulls Construction. Journal of Zhejiang University(Natural Science), 33(2) : 111-114(in Chinese) |