2-Dimensional packing algorithms on a variable-size rectangular interface
- 1 April 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2022-2026
Abstract
The purpose of this work is to propose effective approximate algorithms capable to generate, in a very short time, feasible 2-dimensional configurations (interfaces) containing a set of given menus adapted to a certain user context (physical activity for example). As in some previous works, the proposed approach gives good solutions that minimize the used surface to pack all the tiles into a variable-size bin. Such a size should respect a fixed ratio for the screen between its width and its height. Moreover, the proposed approaches (based on shelf strategy), genetic algorithm are compared to an exact model. The exact resolution of this mathematical model gives an optimal solution only for small instances. For the other instances, it is difficult to reach the optimal value in a short running time, which shows the practical interest of the proposed approaches.Keywords
This publication has 7 references indexed in Scilit:
- Not a tile out of place: Toward creating context-dependent user interfaces on smartglasses2016
- An Exact Method for the 2D Guillotine Strip Packing ProblemAdvances in Operations Research, 2009
- Models and Bounds for Two-Dimensional Level Packing ProblemsJournal of Combinatorial Optimization, 2004
- An Exact Approach to the Strip-Packing ProblemINFORMS Journal on Computing, 2003
- Exact algorithms for the guillotine strip cutting/packing problemComputers & Operations Research, 1998
- Constraint-Based Tiled WindowsIEEE Computer Graphics and Applications, 1986
- On Packing Two-Dimensional BinsSIAM Journal on Algebraic Discrete Methods, 1982