Enumerating the maximum free rectangular areas
News of the Kabardin-Balkar scientific center of RAS, no. 1 (2001), pp. 3-7
Voir la notice de l'article provenant de la source Math-Net.Ru
The paper considers the problem of placing rectangular objects without overlap on a limited flat surface. A discrete model of the problem is constructed. New efficient algorithms have been obtained that use the method of cellular discretization of the problem with subsequent enumeration of all objects of interest. A complete characterization of the problem is given and an optimal algorithm for solving it is given.
Mots-clés :
placement
Keywords: maximum free rectangle, cellular discretization, discrete topology, algorithms, free space
Keywords: maximum free rectangle, cellular discretization, discrete topology, algorithms, free space
@article{IZKAB_2001_1_a0,
author = {U. M. Bishenov and P. M. Ivanov},
title = {Enumerating the maximum free rectangular areas},
journal = {News of the Kabardin-Balkar scientific center of RAS},
pages = {3--7},
publisher = {mathdoc},
number = {1},
year = {2001},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IZKAB_2001_1_a0/}
}
U. M. Bishenov; P. M. Ivanov. Enumerating the maximum free rectangular areas. News of the Kabardin-Balkar scientific center of RAS, no. 1 (2001), pp. 3-7. http://geodesic.mathdoc.fr/item/IZKAB_2001_1_a0/