Cover Image

Computing Oriented Spanners and their Dilation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Buchin, Kevin, Kalb, Antonia, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Rehs, Carolin, Wong, Sampson
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Oriented Spanners
by: Buchin, Kevin, et al.
Published: (2023)

On Small Pair Decompositions for Point Sets
by: Buchin, Kevin, et al.
Published: (2026)

Geometric spanners of bounded tree-width
by: Buchin, Kevin, et al.
Published: (2024)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
by: Buchin, Kevin, et al.
Published: (2024)

Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
by: Buchin, Kevin, et al.
Published: (2025)

Bicriteria approximation for minimum dilation graph augmentation
by: Buchin, Kevin, et al.
Published: (2024)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)

A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
by: Buchin, Kevin, et al.
Published: (2026)

Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)

Faster Fréchet Distance under Transformations
by: Buchin, Kevin, et al.
Published: (2025)

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)

Property Testing of Curve Similarity
by: Afshani, Peyman, et al.
Published: (2025)

Spanner for the $0/1/\infty$ weighted region problem
by: Gudmundsson, Joachim, et al.
Published: (2024)

Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025)

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
by: Bhore, Sujoy, et al.
Published: (2026)

Deciding if a DAG is Interesting is Hard
by: De Carufel, Jean-Lou, et al.
Published: (2025)

Computing $L_\infty$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness
by: Angrick, Sebastian, et al.
Published: (2026)

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

Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)

A well-separated pair decomposition for low density graphs
by: Gudmundsson, Joachim, et al.
Published: (2024)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)

Online Class Cover Problem
by: De, Minati, et al.
Published: (2023)

Generalized Sweeping Line Spanners
by: Lee, Keenan, et al.
Published: (2021)

Dependable Spanners via Unreliable Edges
by: Har-Peled, Sariel, et al.
Published: (2024)

Approximating the Fréchet distance when only one curve is $c$-packed
by: Gudmundsson, Joachim, et al.
Published: (2024)

Linear time single-source shortest path algorithms in Euclidean graph classes
by: Gudmundsson, Joachim, et al.
Published: (2026)

Computing Planar Convex Hulls with a Promise
by: Aghamolaei, Sepideh, et al.
Published: (2026)

The Complexity of Geodesic Spanners
by: de Berg, Sarita, et al.
Published: (2023)

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

Hop-Spanners for Geometric Intersection Graphs
by: Conroy, Jonathan B., et al.
Published: (2021)

Map matching queries on realistic input graphs under the Fréchet distance
by: Gudmundsson, Joachim, et al.
Published: (2022)

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

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

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
by: Dutta, Madhura, et al.
Published: (2025)