Bend minimization
In graph drawing styles that represent the edges of a graph by polylines (sequences of line segments connected at bends), it is desirable to minimize the number of bends per edge (sometimes called the curve complexity) or the total number of bends in a drawing. Bend minimization is the algorithmic problem of finding a drawing that minimizes these quantities.
Link from a Wikipage to another Wikipage
primaryTopic
Bend minimization
In graph drawing styles that represent the edges of a graph by polylines (sequences of line segments connected at bends), it is desirable to minimize the number of bends per edge (sometimes called the curve complexity) or the total number of bends in a drawing. Bend minimization is the algorithmic problem of finding a drawing that minimizes these quantities.
has abstract
In graph drawing styles that r ...... at minimizes these quantities.
@en
Wikipage page ID
43,176,911
page length (characters) of wiki page
Wikipage revision ID
964,679,321
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In graph drawing styles that r ...... at minimizes these quantities.
@en
label
Bend minimization
@en