L-visibility drawings of IC-planar graphs

DOI10.1016/j.ipl.2015.11.011zbMath1328.68263arXiv1507.08879OpenAlexW4254159231MaRDI QIDQ903189

Giuseppe Liotta, Fabrizio Montecchiani

Publication date: 5 January 2016

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

computational geometryvisibility representationsIC-planar graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (14)

Visibility representations of boxes in 2.5 dimensions ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ On morphing 1-planar drawings ⋮ New results on edge partitions of 1-plane graphs ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ Unnamed Item ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ Ortho-polygon visibility representations of 3-connected 1-plane graphs ⋮ Ortho-polygon visibility representations of embedded graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs

Cites Work

• Unnamed Item
• Recognizing and drawing IC-planar graphs
• Drawing graphs with right angle crossings
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Computing an st-numbering
• The structure of plane graphs with independent crossings and its applications to coloring problems
• Simultaneous Visibility Representations of Plane st-graphs Using L-shapes
• The Crossing-Angle Resolution in Graph Drawing
• 1-Visibility Representations of 1-Planar Graphs
• Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
• Coloring plane graphs with independent crossings
• The Straight-Line RAC Drawing Problem is NP-Hard
• Rectilinear drawings of graphs
• Bar k-Visibility Graphs

This page was built for publication: L-visibility drawings of IC-planar graphs