✦ LIBER ✦

Algorithm For Maximal Whitespace Rectangles

✍ Scribed by Breuel, Thomas

Year: 0
Tongue: Spanish
Weight: 886 KB
Category: Fiction

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rectangles algorithm for generating norm

Rectangles algorithm for generating normal variates

✍ Rui Zhang; Lawrence M. Leemis 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

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

Algorithms for covering polygons by rect

Algorithms for covering polygons by rectangles

✍ András Hegedüs 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 288 KB

New algorithms for online rectangle fill

New algorithms for online rectangle filling with

✍ Haitao Wang; Amitabh Chaudhary; Danny Z. Chen 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 424 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

Comparison of meta-heuristic algorithms

Comparison of meta-heuristic algorithms for clustering rectangles

✍ Edmund Burke; Graham Kendall 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 258 KB

In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated