par Bereg, Sergey;Díaz-Báñez, José Miguel;Flores-Peñaloza, David;Langerman, Stefan 
;Pérez-Lantero, Pablo;Urrutia, Jorge
Référence Journal of combinatorial optimization, 31, 3, page (1160-1173)
Publication Publié, 2016-04
;Pérez-Lantero, Pablo;Urrutia, JorgeRéférence Journal of combinatorial optimization, 31, 3, page (1160-1173)
Publication Publié, 2016-04
Article révisé par les pairs
| Résumé : | A set of vertical bars planted on given points of a horizontal line defines a fence composed of the quadrilaterals bounded by successive bars. A set of bars in the plane, each having one endpoint at the origin, defines an umbrella composed of the triangles bounded by successive bars. Given a collection of bars, we study how to use them to build the fence or the umbrella of maximum total area. We present optimal algorithms for these constructions. The problems introduced in this paper are related to the Geometric Knapsack problems (Arkin et al. in Algorithmica 10:399–427, 1993) and the Rearrangement Inequality (Wayne in Scripta Math 12(2):164–169, 1946). |
