Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set

Enclosing a Set of Objects by Two Minimu

Enclosing a Set of Objects by Two Minimum Area Rectangles

✍ Bruno Becker; Paolo Giulio Franciosa; Stephan Gschwind; Stefano Leonardi; Thomas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 737 KB

In this paper, we face the problem of computing an enclosing pair of axis-parallel rectangles of a set of polygonal objects in the plane, serving as a simple container. Ž Ž . . Ž . We propose an O n␣ n log n worst-case time algorithm, where ␣ is the inverse Ackermann's function, for finding, given a