✦ LIBER ✦

Data structures for the rectangle containment and enclosure problems

✍ Scribed by Vijay Vaishnavi; Derick Wood

Publisher: Elsevier Science
Year: 1980
Weight: 942 KB
Volume: 13
Category: Article
ISSN: 0146-664X
DOI: 10.1016/0146-664x(80)90034-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for the rectangle

An improved algorithm for the rectangle enclosure problem

✍ D.T Lee; F.P Preparata 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Typical design problems and solutions fo

Typical design problems and solutions for prestressed concrete containment structures

✍ Howard W. Wahl 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 933 KB

A data structure and algorithm based on

A data structure and algorithm based on a linear key for a rectangle retrieval problem

✍ D.J. Abel; J.L. Smith 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 567 KB

Constant Ratio Approximation Algorithms

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

✍ Daya Ram Gaur; Toshihide Ibaraki; Ramesh Krishnamurti 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 114 KB

We provide constant ratio approximation algorithms for two NP-hard problems, the rectangle stabbing problem and the rectilinear partitioning problem. In the rectangle stabbing problem, we are given a set of rectangles in two-dimensional space, with the objective of stabbing all rectangles with the m

Deferred data structure for the nearest

Deferred data structure for the nearest neighbor problem

✍ Alok Aggarwal; Prabhakar Raghavan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Preservice and inservice requirements fo

Preservice and inservice requirements for containment structures in the United States - A status report

✍ Robert F. Sammataro 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 778 KB