Visibility representations of boxes in 2.5 dimensions

DOI10.1016/j.comgeo.2018.02.007zbMath1443.68195arXiv1608.08899OpenAlexW2906249868MaRDI QIDQ1615673

Emilio Di Giacomo, Giuseppe Liotta, Carla Binucci, William S. Evans, Alessio Arleo, Luca Grilli, Fabrizio Montecchiani, Stephen K. Wismath, S. H. Whitesides, Henk G. Meijer

Publication date: 31 October 2018

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

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

zbMATH Keywords

graph drawingvisibility representations2.5D box visibility representations2.5D geometric representations

Mathematics Subject Classification ID

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

Related Items (10)

Visibility representations of boxes in 2.5 dimensions ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Combinatorial properties and recognition of unit square visibility graphs ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Unnamed Item ⋮ On 3D visibility representations of graphs with few crossings per edge ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Area requirement of visibility representations of trees
• Spiderman graph: visibility in urban regions
• Ortho-polygon visibility representations of embedded graphs
• L-visibility drawings of IC-planar graphs
• Unit rectangle visibility graphs
• Representing a planar graph by vertical lines joining different levels
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• The book thickness of a graph
• Rectangle-visibility representations of bipartite graphs
• Visibility representations of boxes in 2.5 dimensions
• Embeddings of \(k\)-connected graphs of pathwidth \(k\)
• On representations of some thickness-two graphs
• 1-Visibility Representations of 1-Planar Graphs
• Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
• Representations of Graphs on a Cylinder
• Unimaximal Sequences of Pairs in Rectangle Visibility Drawing
• An application of graph coloring to printed circuit testing
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Rectangle-visibility Layouts of Unions and Products of Trees
• A Visibility Representation for Graphs in Three Dimensions
• RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
• Bar k-Visibility Graphs
• Parameters of Bar k-Visibility Graphs
• 1-Bend Orthogonal Partial Edge Drawing
• Convex sets in the plane with three of every four meeting

This page was built for publication: Visibility representations of boxes in 2.5 dimensions