
Introduction
Généralités
Représentation
Qualité Optimisation
Bibliographie
Remarques
I
Graphe vs. arbre (partage de noeuds)
I
Paragraphe rectangulaire
I
Ou conserver le numéro de ligne
I
Branches mortes / arbre mort
I
Importance d’une tolérance ajustable
I
Algorithmes gloutons : ligne par ligne
I
First-Fit, Last-Fit
I
Best-Fit (mais dene « best »…)
I
min(% élasticité ou badness)
*
I
Nombreux autres choix possibles
I
Avantages
I
rapides
I
peu coûteux
I
Inconvénients
I
Pas de notion de qualité globale
I
Sensibles aux branches mortes
Viens
bi-joux.
Em-porte
35
Em-
porte
29
poux.
Un
13
Un
deux
28
6
ce-
rises.
20
ce-rises.
Sept
13
15
Sept
huit
95
elles
se-ront
8
se-
ront
16
94
se-ront
toutes
0,5
toutes
rouges.
4
•
0
0
0
0
Justication de paragraphe : le Knuth-Plass / Exposé GUTenberg, 11 Janvier 2024 – Didier Verna 11/27
The area of
a circle is a mean
proportional between any
two regular and similar poly-
gons of which one circumscribes
it and the other is isoperimetric
with it. In addition, the area of the
circle is less than that of any circum-
scribed polygon and greater than that
of any isoperimetric polygon. And
further, of these circumscribed poly-
gons, the one that has the greater
number of sides has a smaller area
than the one that has a lesser num-
ber; but, on the other hand, the
isoperimetric polygon that
has the greater number of
sides is the larger.