𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On point covers of parallel rectangles

✍ Scribed by GY. K árolyi

Publisher
Springer Netherlands
Year
1991
Tongue
English
Weight
142 KB
Volume
23
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Covering Z-Grid Points by Rectangles
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

Enclosing k points in the smallest axis
Enclosing k points in the smallest axis parallel rectangle
✍ Michael Segal; Klara Kedem 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 445 KB

We consider the following clustering problem. Given a set S of II points in the plane, and given an integer k, n/2 < k < n, we want to find the smallest axis parallel rectangle (smallest perimeter or area) that encloses exactly k points of S. We present an algorithm which runs in time 0( n + k( n -k

Covering of polygons by rectangles
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