Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

DOI10.7155/jgaa.00632zbMath1522.05328MaRDI QIDQ6075712

Unnamed Author, Sabine Cornelsen

Publication date: 20 September 2023

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

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)

Cites Work

• Unnamed Item
• Optimal coding and sampling of triangulations
• A linear algorithm to find a rectangular dual of a planar triangulated graph
• Algorithms for plane representations of acyclic digraphs
• Lower bounds for planar orthogonal drawings of graphs
• Quasi-upward planarity
• A better heuristic for orthogonal graph drawings
• Bitonic st-orderings for upward planar graphs: the variable embedding setting
• Quasi-upward planar drawings with minimum curve complexity
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
• Bitonic st-orderings for Upward Planar Graphs
• Algorithms and Bounds for L-Drawings of Directed Graphs
• A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Planar L-Drawings of Directed Graphs
• Planar L-Drawings of Bimodal Graphs
• The (3,1)-ordering for 4-connected planar triangulations
• Two algorithms for finding rectangular duals of planar graphs

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