Planar L-Drawings of Bimodal Graphs
From MaRDI portal
Publication:5014118
DOI10.1007/978-3-030-68766-3_17OpenAlexW3134372918MaRDI QIDQ5014118
Sabine Cornelsen, Steven Chaplick, Patrizio Angelini, Giordano Da Lozzo
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.07834
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- A linear algorithm to find a rectangular dual of a planar triangulated graph
- Upward and quasi-upward planarity testing of embedded mixed graphs
- Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
- Algorithms and Bounds for L-Drawings of Directed Graphs
- A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
- Rectangular duals of planar graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On Finding the Rectangular Duals of Planar Triangular Graphs
- On Triangle Contact Graphs
- Planar L-Drawings of Directed Graphs
- Computing k-modal embeddings of planar digraphs
- The (3,1)-ordering for 4-connected planar triangulations
- Two algorithms for finding rectangular duals of planar graphs
- Unnamed Item