Image de couverture de livre

Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cornelsen, Sabine, Förster, Henry, Gupta, Siddharth, Kobourov, Stephen, Zink, Johannes
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
par: Förster, Henry, et autres
Publié: (2025)

Using Reinforcement Learning to Optimize the Global and Local Crossing Number
par: Brand, Timo, et autres
Publié: (2025)

Upward-Planar Drawings with Bounded Span
par: Angelini, Patrizio, et autres
Publié: (2026)

Simultaneous Embedding of Two Paths on the Grid
par: Kobourov, Stephen, et autres
Publié: (2026)

The Complexity of Drawing Graphs on Few Lines and Few Planes
par: Chaplick, Steven, et autres
Publié: (2016)

Planar Stories of Graph Drawings: Algorithms and Experiments
par: Binucci, Carla, et autres
Publié: (2025)

Linear Layouts of Graphs with Priority Queues
par: Di Giacomo, Emilio, et autres
Publié: (2025)

Morphing Graph Drawings in the Presence of Point Obstacles
par: Firman, Oksana, et autres
Publié: (2023)

The Parametrized Complexity of the Segment Number
par: Cornelsen, Sabine, et autres
Publié: (2023)

On RAC Drawings of Graphs with Two Bends per Edge
par: Tóth, Csaba D.
Publié: (2023)

On $k$-Plane Insertion into Plane Drawings
par: Katheder, Julia, et autres
Publié: (2024)

Grounded String Representations of Series-Parallel Graphs without Transitive Edges
par: Cornelsen, Sabine, et autres
Publié: (2026)

Crossing Number of 3-Plane Drawings
par: Goetze, Miriam, et autres
Publié: (2025)

Simultaneous Drawing of Layered Trees
par: Katheder, Julia, et autres
Publié: (2023)

Plane Hamiltonian Cycles in Convex Drawings
par: Bergold, Helena, et autres
Publié: (2024)

Morphing Planar Graph Drawings via Orthogonal Box Drawings
par: Biedl, Therese, et autres
Publié: (2024)

Edge-Constrained Hamiltonian Paths on a Point Set
par: Antić, Todor, et autres
Publié: (2025)

Unbent Collections of Orthogonal Drawings
par: Antić, Todor, et autres
Publié: (2025)

Min-$k$-planar Drawings of Graphs
par: Binucci, Carla, et autres
Publié: (2023)

Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
par: Jain, Naman
Publié: (2024)

An Improved Bound for Plane Covering Paths
par: Akitaya, Hugo A., et autres
Publié: (2025)

On the Connectivity of the Flip Graph of Plane Spanning Paths
par: Kleist, Linda, et autres
Publié: (2024)

Same Quality Metrics, Different Graph Drawings
par: van Wageningen, Simon, et autres
Publié: (2025)

Continuous Map Matching to Paths under Travel Time Constraints
par: Bosch, Yannick, et autres
Publié: (2025)

Size Should not Matter: Scale-invariant Stress Metrics
par: Ahmed, Reyan, et autres
Publié: (2024)

Drawings of Complete Multipartite Graphs Up to Triangle Flips
par: Aichholzer, Oswin, et autres
Publié: (2023)

Graph Drawing Stress Model with Resistance Distances
par: Onoue, Yosuke
Publié: (2025)

Exploring MLLMs Perception of Network Visualization Principles
par: Miller, Jacob, et autres
Publié: (2025)

On Compaction and Realizability of Almost Convex Octilinear Representations
par: Förster, Henry, et autres
Publié: (2025)

The Perception of Stress in Graph Drawings
par: Mooney, Gavin J., et autres
Publié: (2024)

Unit-length Rectangular Drawings of Graphs
par: Alegria, Carlos, et autres
Publié: (2022)

Three Edge-disjoint Plane Spanning Paths in a Point Set
par: Kindermann, Philipp, et autres
Publié: (2023)

Drawing Reeb Graphs
par: Chambers, Erin, et autres
Publié: (2025)

Long Plane Trees
par: Cabello, Sergio, et autres
Publié: (2021)

Further Connectivity Results on Plane Spanning Path Reconfiguration
par: Boucard, Valentino, et autres
Publié: (2024)

Homotopy-Aware Multi-Agent Path Planning on Plane
par: Kasaura, Kazumi
Publié: (2023)

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
par: Aichholzer, Oswin, et autres
Publié: (2023)

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
par: Chan, Timothy M., et autres
Publié: (2026)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
par: Hliněný, Petr, et autres
Publié: (2025)

Morphing Planar Graph Drawings Through 3D
par: Buchin, Kevin, et autres
Publié: (2022)