Planar confluent orthogonal drawings of 4-modal digraphs

DOI10.1007/978-3-031-22203-0_9arXiv2208.13446OpenAlexW4317393963MaRDI QIDQ6117039

Sabine Cornelsen, Unnamed Author

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.13446

zbMATH Keywords

curve complexityirreducible triangulations(Quasi-)upward planardirected plane graphskandinsky drawingsL-drawings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Planar confluent orthogonal drawings of 4-modal digraphs ⋮ Unnamed Item

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
• 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
• Planar confluent orthogonal drawings of 4-modal digraphs

This page was built for publication: Planar confluent orthogonal drawings of 4-modal digraphs