Cover Image

Morphing Graph Drawings in the Presence of Point Obstacles

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Firman, Oksana, Hegemann, Tim, Klemz, Boris, Klesen, Felix, Sieper, Marie Diana, Wolff, Alexander, Zink, Johannes
Format:	Preprint
Published:	2023
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Constrained and Ordered Level Planarity Parameterized by the Number of Levels
by: Blažej, Václav, et al.
Published: (2024)

Outside-Obstacle Representations with All Vertices on the Outer Face
by: Firman, Oksana, et al.
Published: (2022)

Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
by: Klemz, Boris, et al.
Published: (2024)

Outerplanar and Forest Storyplans
by: Fiala, Jiří, et al.
Published: (2023)

Morphing Planar Graph Drawings Through 3D
by: Buchin, Kevin, et al.
Published: (2022)

The Complexity of Finding Tangles
by: Firman, Oksana, et al.
Published: (2020)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
by: Firman, Oksana, et al.
Published: (2024)

Adjacency Graphs of Polyhedral Surfaces
by: Arseneva, Elena, et al.
Published: (2021)

Morphing Planar Graph Drawings via Orthogonal Box Drawings
by: Biedl, Therese, et al.
Published: (2024)

On Triangular Separation of Bichromatic Point Sets
by: Bergold, Helena, et al.
Published: (2025)

Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
by: Cornelsen, Sabine, et al.
Published: (2025)

Clustered Planarity Variants for Level Graphs
by: Fink, Simon D., et al.
Published: (2024)

The Complexity of Drawing Graphs on Few Lines and Few Planes
by: Chaplick, Steven, et al.
Published: (2016)

Unbent Collections of Orthogonal Drawings
by: Antić, Todor, et al.
Published: (2025)

Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
by: Förster, Henry, et al.
Published: (2025)

Computing Height-Optimal Tangles Faster
by: Firman, Oksana, et al.
Published: (2019)

Upward-Planar Drawings with Bounded Span
by: Angelini, Patrizio, et al.
Published: (2026)

Visualization of Event Graphs for Train Schedules
by: Hartleb, Johann, et al.
Published: (2025)

The Parameterized Complexity of Coloring Mixed Graphs
by: Lauerbach, Antonio, et al.
Published: (2026)

Coloring and Recognizing Directed Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2023)

Min-$k$-planar Drawings of Graphs
by: Binucci, Carla, et al.
Published: (2023)

Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
by: Jain, Naman
Published: (2024)

Edge-Constrained Hamiltonian Paths on a Point Set
by: Antić, Todor, et al.
Published: (2025)

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
by: Di Battista, Giuseppe, et al.
Published: (2021)

Planar Stories of Graph Drawings: Algorithms and Experiments
by: Binucci, Carla, et al.
Published: (2025)

Same Quality Metrics, Different Graph Drawings
by: van Wageningen, Simon, et al.
Published: (2025)

Linear Layouts of Graphs with Priority Queues
by: Di Giacomo, Emilio, et al.
Published: (2025)

Drawings of Complete Multipartite Graphs Up to Triangle Flips
by: Aichholzer, Oswin, et al.
Published: (2023)

Graph Drawing Stress Model with Resistance Distances
by: Onoue, Yosuke
Published: (2025)

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
by: Spalding-Jamieson, Jack, et al.
Published: (2025)

Unit-length Rectangular Drawings of Graphs
by: Alegria, Carlos, et al.
Published: (2022)

Drawing Reeb Graphs
by: Chambers, Erin, et al.
Published: (2025)

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

Holes in Convex and Simple Drawings
by: Bergold, Helena, et al.
Published: (2024)

Recognizing 2-Layer and Outer $k$-Planar Graphs
by: Kobayashi, Yasuaki, et al.
Published: (2024)

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
by: Aichholzer, Oswin, et al.
Published: (2023)

Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
by: Honorato-Droguett, Nicolás, et al.
Published: (2025)

Eliminating Crossings in Ordered Graphs
by: Agrawal, Akanksha, et al.
Published: (2024)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)

Drawing maps on oriented surfaces
by: Brinkmann, Gunnar
Published: (2025)