✦ LIBER ✦

Algorithms for covering polygons by rectangles

✍ Scribed by András Hegedüs

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 288 KB
Volume: 14
Category: Article
ISSN: 0010-4485
DOI: 10.1016/0010-4485(82)90104-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering of polygons by rectangles

✍ F. Cheng; I.-M. Lin 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Decomposing complex patterns into standardized geometric areas is essential for many pattern recognition and CAD applications 7"2. The decomposition of polygons into rectangles is studied in the paper. An algorithm that covers convex polygons by rectangles is presented. The algorithm works in two st

Covering a square by small perimeter rec

Covering a square by small perimeter rectangles

✍ N. Alon; D. J. Kleitman 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 372 KB

On Covering Z-Grid Points by Rectangles

✍ Stefan Porschen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 261 KB

A problem of combinatorial geometry is discussed: Cover a finite set of points lying on an integer grid in the Euclidean plane by regular rectangles such that the total area, circumference and number of rectangles used is minimized. This problem seems to be NP-hard, which is surely the case for rela

How Many Diagonal Rectangles Are Needed

How Many Diagonal Rectangles Are Needed to Cover an Orthogonal Polygon?

✍ Yoshiyasu Ishigami 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 419 KB

Systolic algorithms for rectilinear poly

Systolic algorithms for rectilinear polygons

✍ Rajiv Kane; Sartaj Sahni 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Algorithm For Maximal Whitespace Rectang

Algorithm For Maximal Whitespace Rectangles

✍ Breuel, Thomas 📂 Fiction 📅 0 🌐 Spanish ⚖ 886 KB