✦ LIBER ✦

An optimal algorithm for rectangle placement

✍ Scribed by Patrick Healy; Marcus Creavin; Ago Kuusik

Book ID: 108410548
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 164 KB
Volume: 24
Category: Article
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(98)00048-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm for reporting visib

An optimal algorithm for reporting visible rectangles

✍ N. Kitsios; C. Makris; S. Sioutas; A. Tsakalidis; J. Tsaknakis; B. Vassiliadis 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 75 KB

We consider the following problem as defined by Grove et al. [Internat. J. Comput. Geom. Appl. 9 (1999) 207-217]: Given a set of n isothetic rectangles in 3D space determine the subset of rectangles, that are not completely hidden. We present an optimal algorithm for this problem that runs in O(n lo

An optimal time and minimal space algori

An optimal time and minimal space algorithm for rectangle intersection problems

✍ D. T. Lee 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 478 KB

An algorithm for near-optimal placement

An algorithm for near-optimal placement of sensor elements

✍ Pearson, D.; Pillai, S.U.; Lee, Y. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 491 KB

An improved algorithm for online rectang

An improved algorithm for online rectangle filling

✍ Rob van Stee 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 507 KB

An algorithm for optimal buffer placemen

An algorithm for optimal buffer placement in reliable serial lines

✍ JOHN H. HARRIS; STEPHEN G. POWELL 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 160 KB

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