Unit-length rectangular drawings of graphs
From MaRDI portal
Publication:6117041
DOI10.1007/978-3-031-22203-0_10arXiv2208.14142OpenAlexW4317393947MaRDI QIDQ6117041
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Grosso, Carlos Alegría, Fabrizio Frati, Maurizio Patrignani
Publication date: 16 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.14142
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Unit-length rectangular drawings of graphs, An annotated review on graph drawing and its applications, Grid recognition: classical and parameterized computational perspectives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of minimizing wire lengths in VLSI layouts
- Unit-length embedding of binary trees on a square grid
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- A better heuristic for orthogonal graph drawings
- Rectangular grid drawings of plane graphs
- Fixed edge-length graph drawing is NP-hard
- Incremental convex planarity testing
- On-line maintenance of triconnected components with SPQR-trees
- Drawing planar graphs using the canonical ordering
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- An approximation algorithm for the longest path problem in solid grid graphs
- Rectangle and Square Representations of Planar Graphs
- Thirty Essays on Geometric Graph Theory
- Anchored Drawings of Planar Graphs
- Who Needs Crossings? Hardness of Plane Graph Rigidity
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- Rectilinear Graphs and Their Embeddings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Spirality and Optimal Orthogonal Drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- Orthogonal Drawings of Plane Graphs Without Bends
- On-Line Planarity Testing
- Hamilton Paths in Grid Graphs
- Rectangular drawings of planar graphs
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Puzzling Grid Embeddings
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
- Planar Embeddings of Graphs with Specified Edge Lengths
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- Optimal Morphs of Convex Drawings
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
- On Diagrams Representing Maps
- Accelerated Bend Minimization
- Graph Drawing
- Graph Drawing
- Unit-length rectangular drawings of graphs
- Grid recognition: classical and parameterized computational perspectives
