Image de couverture de livre

Optimal Orthogonal Drawings in Linear Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Didimo, Walter, Liotta, Giuseppe, Ortali, Giacomo, Patrignani, Maurizio
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

On Planar Straight-Line Dominance Drawings
par: Angelini, Patrizio, et autres
Publié: (2025)

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

Internally-Convex Drawings of Outerplanar Graphs in Small Area
par: Bekos, Michael A., et autres
Publié: (2025)

Ortho-Radial Drawing in Near-Linear Time
par: Chang, Yi-Jun
Publié: (2023)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
par: Di Battista, Giuseppe, et autres
Publié: (2024)

Weakly Leveled Planarity with Bounded Span
par: Bekos, Michael, et autres
Publié: (2024)

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

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

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
par: Dobler, Alexander, et autres
Publié: (2024)

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
par: Di Battista, Giuseppe, et autres
Publié: (2021)

Touring a Sequence of Orthogonal Polygons
par: Casel, Katrin, et autres
Publié: (2026)

Upward Pointset Embeddings of Planar st-Graphs
par: Alegria, Carlos, et autres
Publié: (2024)

Simple Realizability of Abstract Topological Graphs
par: Da Lozzo, Giordano, et autres
Publié: (2024)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
par: Iacono, John, et autres
Publié: (2025)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
par: Cabello, Sergio, et autres
Publié: (2021)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
par: Afshani, Peyman, et autres
Publié: (2026)

Simple Compact Monotone Tree Drawings
par: Oikonomou, Anargyros, et autres
Publié: (2017)

Exact Algorithms for Clustered Planarity with Linear Saturators
par: Da Lozzo, Giordano, et autres
Publié: (2024)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
par: Depian, Thomas, et autres
Publié: (2025)

An Optimal Algorithm for Half-plane Hitting Set
par: Liu, Gang, et autres
Publié: (2025)

Optimal Trajectories in Discrete Space with Acceleration Constraints
par: Casteigts, Arnaud, et autres
Publié: (2026)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2025)

Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
par: La, An, et autres
Publié: (2025)

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
par: Huang, Lingxiao, et autres
Publié: (2022)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
par: de Berg, Sarita, et autres
Publié: (2026)

Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
par: Chandran, L. Sunil, et autres
Publié: (2024)

Fréchet Distance in Subquadratic Time
par: Cheng, Siu-Wing, et autres
Publié: (2024)

Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
par: Nekrich, Yakov, et autres
Publié: (2026)

2-Layer Fan-Planarity in Polynomial Time
par: Kobayashi, Yasuaki, et autres
Publié: (2025)

Dynamically Maintaining the Persistent Homology of Time Series
par: di Montesano, Sebastiano Cultrera, et autres
Publié: (2023)

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
par: Cheng, Siu-Wing, et autres
Publié: (2025)

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

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
par: Eppstein, David
Publié: (2023)

A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem
par: Xu, Xiaoyang, et autres
Publié: (2023)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
par: S, Ajaykrishnan E, et autres
Publié: (2025)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
par: Ebbens, Matthijs, et autres
Publié: (2024)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
par: Chan, Timothy M., et autres
Publié: (2025)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)