𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum cost partitions of a rectangle

✍ Scribed by Michelle L. Wachs

Book ID
108316026
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
794 KB
Volume
36
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning a rectangle into small peri
Partitioning a rectangle into small perimeter rectangles
✍ Noga Alon; Daniel J. Kleitman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 593 KB

We show that the way to partition a unit square into kZ + s rectangles, for s = 1 or s = -1, so as to minimize the largest perimeter of the rectangles, is to have k -1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having the same perimeter. We also co

Enumération des partitions de diamètre m
Enumération des partitions de diamètre minimum
✍ A. Guénoche 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 717 KB

Nous knumtrons les p-partitions des sommets d'un graphe valut (partitions i nombre de classes p fix&) de diamktre d minimum. Dans le cas 03 p=2, nous rappelons la construction de M.R. Rao qui permet de les dknombrer et de les knumker. Pour p> 2 le probltme revient B construire un graphe seuil minimu

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