Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity

DOI10.1007/978-3-030-04414-5_36OpenAlexW2888784884MaRDI QIDQ1725786

Xianqiang Yang

Publication date: 15 February 2019

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

Mathematics Subject Classification ID

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

Related Items (3)

Drawing outer-1-planar graphs revisited ⋮ Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity ⋮ Crossing Layout in Non-planar Graph Drawings

Cites Work

• Unnamed Item
• Outer 1-planar graphs
• A linear-time algorithm for testing outer-1-planarity
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• A better heuristic for orthogonal graph drawings
• Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• Smooth Orthogonal Layouts
• Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
• Fáry’s Theorem for 1-Planar Graphs
• 1-Visibility Representations of 1-Planar Graphs
• Rectilinear drawings of graphs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Universality considerations in VLSI circuits
• New lower bound techniques for VLSI
• EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
• Smooth Orthogonal Drawings of Planar Graphs
• Lombardi Drawings of Graphs

This page was built for publication: Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity