Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

DOI10.7155/JGAA.00632MaRDI QIDQ6075712zbMATH OpenFDO

Authors Sabine Cornelsen

Publication date 20 September 2023

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.00632

zbMATH Keywords

Kandinsky drawingsplanar confluent orthogonal drawingplanar L-drawings of subdivisions of digraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Quasi-upward planarity
• Planar L-drawings of bimodal graphs
• Graph Drawing
• Strict Confluent Drawing

Cites work

• A better heuristic for orthogonal graph drawings
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
• Algorithms and bounds for L-drawings of directed graphs
• Algorithms for plane representations of acyclic digraphs
• Bitonic st-orderings for upward planar graphs
• Bitonic st-orderings for upward planar graphs: the variable embedding setting
• Complexity of higher-degree orthogonal graph embedding in the Kandinsky model
• scientific article; zbMATH DE number 1947397 (Why is no real title available?)
• Lower bounds for planar orthogonal drawings of graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On Finding the Rectangular Duals of Planar Triangular Graphs
• On the computational complexity of upward and rectilinear planarity testing
• Optimal coding and sampling of triangulations
• Planar L-drawings of bimodal graphs
• Planar L-drawings of directed graphs
• Quasi-upward planar drawings with minimum curve complexity
• Quasi-upward planarity
• The (3,1)-ordering for 4-connected planar triangulations
• Two algorithms for finding rectangular duals of planar graphs

Cited in

(3)

• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Computing k-modal embeddings of planar digraphs
• On upward-planar L-drawings of graphs

This page was built for publication: Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6075712)