Embedding-preserving rectangle visibility representations of nonplanar graphs
From MaRDI portal
Publication:1991089
DOI10.1007/s00454-017-9939-yzbMath1402.68184arXiv1511.08592OpenAlexW3105145933MaRDI QIDQ1991089
Fabrizio Montecchiani, Giuseppe Liotta, Therese C. Biedl
Publication date: 30 October 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08592
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, Simultaneous visibility representations of undirected pairs of graphs, Ortho-polygon visibility representations of 3-connected 1-plane graphs, On 3D visibility representations of graphs with few crossings per edge, Beyond Planar Graphs: Introduction, Edge Partitions and Visibility Representations of 1-planar Graphs, 1-planarity testing and embedding: an experimental study
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Area requirement of visibility representations of trees
- Recognizing and drawing IC-planar graphs
- Relating bends and size in orthogonal graph drawings
- On drawings and decompositions of 1-planar graphs
- Ortho-polygon visibility representations of embedded graphs
- L-visibility drawings of IC-planar graphs
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- 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
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Graphs drawn with few crossings per edge
- Triangulating planar graphs while minimizing the maximum degree
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Right angle crossing graphs and 1-planarity
- On representations of some thickness-two graphs
- On RAC drawings of 1-planar graphs
- An annotated bibliography on 1-planarity
- Minimal non-1-planar graphs
- Recognizing hole-free 4-map graphs in cubic time
- The Crossing-Angle Resolution in Graph Drawing
- Rectangle and Square Representations of Planar Graphs
- 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
- Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
- Re-embeddings of Maximum 1-Planar Graphs
- Arboricity and Subgraph Listing Algorithms
- Rectilinear drawings of graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On Finding the Rectangular Duals of Planar Triangular Graphs
- Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract)
- On the Density of Maximal 1-Planar Graphs
- 1-Planarity of Graphs with a Rotation System
- Bar k-Visibility Graphs
- On Diagrams Representing Maps
- Morphing orthogonal planar graph drawings
- Enumeration of simple complete topological graphs
