Morphing Planar Graph Drawings via Orthogonal Box Drawings
Fuente:
arXiv
Saved in:
| Main Authors: | Biedl, Therese, Lubiw, Anna, Spalding-Jamieson, Jack |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Morphing Planar Graph Drawings Through 3D
by: Buchin, Kevin, et al.
Published: (2022)
by: Buchin, Kevin, et al.
Published: (2022)
Morphing Graph Drawings in the Presence of Point Obstacles
by: Firman, Oksana, et al.
Published: (2023)
by: Firman, Oksana, et al.
Published: (2023)
Finding a Shortest Curve that Separates Few Objects from Many
by: Biedl, Therese, et al.
Published: (2025)
by: Biedl, Therese, et al.
Published: (2025)
Planar Stories of Graph Drawings: Algorithms and Experiments
by: Binucci, Carla, et al.
Published: (2025)
by: Binucci, Carla, et al.
Published: (2025)
Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
by: Jain, Naman
Published: (2024)
by: Jain, Naman
Published: (2024)
Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
by: Spalding-Jamieson, Jack
Published: (2025)
by: Spalding-Jamieson, Jack
Published: (2025)
Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)
by: Biedl, Therese
Published: (2025)
by: Biedl, Therese
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)
by: Di Battista, Giuseppe, et al.
Published: (2021)
Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
by: Biedl, Therese, et al.
Published: (2026)
by: Biedl, Therese, et al.
Published: (2026)
On Computing Vertex Connectivity of 1-Plane Graphs
by: Biedl, Therese, et al.
Published: (2022)
by: Biedl, Therese, et al.
Published: (2022)
Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
by: Lynch, Jayson, et al.
Published: (2025)
by: Lynch, Jayson, et al.
Published: (2025)
k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)
by: Hliněný, Petr, et al.
Published: (2025)
Upward-Planar Drawings with Bounded Span
by: Angelini, Patrizio, et al.
Published: (2026)
by: Angelini, Patrizio, et al.
Published: (2026)
On Planar Straight-Line Dominance Drawings
by: Angelini, Patrizio, et al.
Published: (2025)
by: Angelini, Patrizio, et al.
Published: (2025)
Optimal Orthogonal Drawings in Linear Time
by: Didimo, Walter, et al.
Published: (2025)
by: Didimo, Walter, et al.
Published: (2025)
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
by: Spalding-Jamieson, Jack, et al.
Published: (2025)
by: Spalding-Jamieson, Jack, et al.
Published: (2025)
Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
by: Eppstein, David, et al.
Published: (2024)
by: Eppstein, David, et al.
Published: (2024)
Finding maximum matchings in RDV graphs efficiently
by: Biedl, Therese, et al.
Published: (2024)
by: Biedl, Therese, et al.
Published: (2024)
Unbent Collections of Orthogonal Drawings
by: Antić, Todor, et al.
Published: (2025)
by: Antić, Todor, et al.
Published: (2025)
Min-$k$-planar Drawings of Graphs
by: Binucci, Carla, et al.
Published: (2023)
by: Binucci, Carla, et al.
Published: (2023)
Slant/Gokigen Naname is NP-complete, and Some Variations are in P
by: Lynch, Jayson, et al.
Published: (2025)
by: Lynch, Jayson, et al.
Published: (2025)
Same Quality Metrics, Different Graph Drawings
by: van Wageningen, Simon, et al.
Published: (2025)
by: van Wageningen, Simon, et al.
Published: (2025)
A Walk on the Wild Side: a Shape-First Methodology for Orthogonal Drawings
by: Andreola, Giordano, et al.
Published: (2025)
by: Andreola, Giordano, et al.
Published: (2025)
On the complexity of embedding in graph products
by: Biedl, Therese, et al.
Published: (2023)
by: Biedl, Therese, et al.
Published: (2023)
Drawing Reeb Graphs
by: Chambers, Erin, et al.
Published: (2025)
by: Chambers, Erin, et al.
Published: (2025)
Saturated Drawings of Geometric Thickness k
by: Bachmann, Patricia, et al.
Published: (2025)
by: Bachmann, Patricia, et al.
Published: (2025)
Graph Drawing Stress Model with Resistance Distances
by: Onoue, Yosuke
Published: (2025)
by: Onoue, Yosuke
Published: (2025)
Drawings of Complete Multipartite Graphs Up to Triangle Flips
by: Aichholzer, Oswin, et al.
Published: (2023)
by: Aichholzer, Oswin, et al.
Published: (2023)
Unit-length Rectangular Drawings of Graphs
by: Alegria, Carlos, et al.
Published: (2022)
by: Alegria, Carlos, et al.
Published: (2022)
Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
by: Spalding-Jamieson, Jack, et al.
Published: (2025)
by: Spalding-Jamieson, Jack, et al.
Published: (2025)
The Complexity of Drawing Graphs on Few Lines and Few Planes
by: Chaplick, Steven, et al.
Published: (2016)
by: Chaplick, Steven, et al.
Published: (2016)
The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving
by: Robson, Eliot W., et al.
Published: (2024)
by: Robson, Eliot W., et al.
Published: (2024)
Carving Polytopes with Saws in 3D
by: Robson, Eliot W., et al.
Published: (2024)
by: Robson, Eliot W., et al.
Published: (2024)
Drawing maps on oriented surfaces
by: Brinkmann, Gunnar
Published: (2025)
by: Brinkmann, Gunnar
Published: (2025)
Sweeping $x$-monotone pseudolines
by: Biedl, Therese, et al.
Published: (2025)
by: Biedl, Therese, et al.
Published: (2025)
Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals
by: Lubiw, Anna, et al.
Published: (2025)
by: Lubiw, Anna, et al.
Published: (2025)
Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O(n^{1.032})$ Area
by: Bui, Hong Duc
Published: (2025)
by: Bui, Hong Duc
Published: (2025)
On RAC Drawings of Graphs with Two Bends per Edge
by: Tóth, Csaba D.
Published: (2023)
by: Tóth, Csaba D.
Published: (2023)
On $k$-Plane Insertion into Plane Drawings
by: Katheder, Julia, et al.
Published: (2024)
by: Katheder, Julia, et al.
Published: (2024)
Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
by: Aichholzer, Oswin, et al.
Published: (2023)
by: Aichholzer, Oswin, et al.
Published: (2023)
Similar Items
-
Morphing Planar Graph Drawings Through 3D
by: Buchin, Kevin, et al.
Published: (2022) -
Morphing Graph Drawings in the Presence of Point Obstacles
by: Firman, Oksana, et al.
Published: (2023) -
Finding a Shortest Curve that Separates Few Objects from Many
by: Biedl, Therese, et al.
Published: (2025) -
Planar Stories of Graph Drawings: Algorithms and Experiments
by: Binucci, Carla, et al.
Published: (2025) -
Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
by: Jain, Naman
Published: (2024)