Cover Image

Morphing Planar Graph Drawings Through 3D

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Buchin, Kevin, Evans, Will, Frati, Fabrizio, Kostitsyna, Irina, Löffler, Maarten, Ophelders, Tim, Wolff, Alexander
Format:	Preprint
Published:	2022
Subjects:	Computational Geometry Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

On Planar Straight-Line Dominance Drawings
by: Angelini, Patrizio, et al.
Published: (2025)

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

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

Internally-Convex Drawings of Outerplanar Graphs in Small Area
by: Bekos, Michael A., et al.
Published: (2025)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)

Upward Pointset Embeddings of Planar st-Graphs
by: Alegria, Carlos, et al.
Published: (2024)

Weakly Leveled Planarity with Bounded Span
by: Bekos, Michael, et al.
Published: (2024)

Upward Book Embeddings of Partitioned Digraphs
by: Da Lozzo, Giordano, et al.
Published: (2026)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
by: Di Battista, Giuseppe, et al.
Published: (2024)

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

The Complexity of Geodesic Spanners using Steiner Points
by: de Berg, Sarita, et al.
Published: (2024)

Universal Coating by 3D Hybrid Programmable Matter
by: Kostitsyna, Irina, et al.
Published: (2023)

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

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
by: Dobler, Alexander, et al.
Published: (2024)

Optimal Orthogonal Drawings in Linear Time
by: Didimo, Walter, et al.
Published: (2025)

Orienteering (with Time Windows) on Restricted Graph Classes
by: Buchin, Kevin, et al.
Published: (2024)

Ortho-Radial Drawing in Near-Linear Time
by: Chang, Yi-Jun
Published: (2023)

Min-1-Planarity is NP-Hard
by: Okada, Yuto
Published: (2026)

2-Layer Fan-Planarity in Polynomial Time
by: Kobayashi, Yasuaki, et al.
Published: (2025)

Exact Algorithms for Clustered Planarity with Linear Saturators
by: Da Lozzo, Giordano, et al.
Published: (2024)

Distance Approximating Minors for Planar and Minor-Free Graphs
by: Chang, Hsien-Chih, et al.
Published: (2025)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
by: Iacono, John, et al.
Published: (2025)

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

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
by: Cabello, Sergio, et al.
Published: (2025)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
by: Bhore, Sujoy, et al.
Published: (2024)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
by: Park, Seongbin, et al.
Published: (2026)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
by: Afshani, Peyman, et al.
Published: (2026)

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

Simple Compact Monotone Tree Drawings
by: Oikonomou, Anargyros, et al.
Published: (2017)

Dynamic Connectivity in Disk Graphs
by: Baumann, Alexander, et al.
Published: (2021)

O(1)-Distortion Planar Emulators for String Graphs
by: Chang, Hsien-Chih, et al.
Published: (2025)

Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
by: Löffler, Maarten, et al.
Published: (2026)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
by: Grandoni, Fabrizio, et al.
Published: (2026)

Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities
by: Evans, William, et al.
Published: (2023)

Layered Graph Drawing with Few Gaps and Few Crossings
by: Dobler, Alexander, et al.
Published: (2025)

One-Sided Local Crossing Minimization
by: Giannopoulos, Panos, et al.
Published: (2025)

On Solving Simple Curved Nonograms
by: Löffler, Maarten, et al.
Published: (2025)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
by: S, Ajaykrishnan E, et al.
Published: (2025)