On 3D visibility representations of graphs with few crossings per edge

DOI10.1016/j.tcs.2019.03.029zbMath1423.68325OpenAlexW2925145625WikidataQ128162831 ScholiaQ128162831MaRDI QIDQ2317866

Yanyan Li

Publication date: 13 August 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.03.029

zbMATH Keywords

graph drawingvisibility representations\(k\)-planar graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Fixed-parameter tractability for book drawing with bounded number of crossings per edge ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Ortho-polygon visibility representations of embedded graphs
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Algorithms for plane representations of acyclic digraphs
• Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
• Graphs drawn with few crossings per edge
• Rectangle-visibility representations of bipartite graphs
• Visibility representations of boxes in 2.5 dimensions
• On representations of some thickness-two graphs
• Embedding-preserving rectangle visibility representations of nonplanar graphs
• An annotated bibliography on 1-planarity
• Algorithms for graphs embeddable with few crossings per edge
• 1-Visibility Representations of 1-Planar Graphs
• Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
• Unimaximal Sequences of Pairs in Rectangle Visibility Drawing
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• A Visibility Representation for Graphs in Three Dimensions
• RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
• On Optimal 2- and 3-Planar Graphs
• Guest Editors' Foreword and Overview
• 3D Visibility Representations of 1-planar Graphs
• Bar k-Visibility Graphs
• Ortho-polygon visibility representations of 3-connected 1-plane graphs
• Edge partitions of optimal 2-plane and 3-plane graphs

This page was built for publication: On 3D visibility representations of graphs with few crossings per edge