Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
Medientyp:
Sonstige Veröffentlichung;
E-Artikel
Titel:
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
Beteiligte:
Cornelsen, Sabine
[VerfasserIn];
Diatzko, Gregor
[VerfasserIn]
Erschienen:
KOPS - The Institutional Repository of the University of Konstanz, 2023
Erschienen in:Journal of Graph Algorithms and Applications. Brown University. 2023, 27(7), pp. 523-540. eISSN 1526-1719. Available under: doi:10.7155/jgaa.00632
Anmerkungen:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Beschreibung:
In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may overlap in their first or last segment, but must not intersect otherwise. PCODs can be seen as a directed variant of Kandinsky drawings or as planar L-drawings of subdivisions of digraphs. The maximum number of subdivision vertices in any edge is then the split complexity. A PCOD is upward if each edge is drawn with monotonically increasing y-coordinates and quasi-upward if no edge starts with decreasing y-coordinates. We study the split complexity of PCODs and (quasi-)upward PCODs for various classes of graphs. ; published