Image de couverture de livre

The Complexity of Geodesic Spanners using Steiner Points

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	de Berg, Sarita, Ophelders, Tim, Parada, Irene, Staals, Frank, Wulms, Jules
Format:	Preprint
Publié:	2024
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

The Complexity of Geodesic Spanners
par: de Berg, Sarita, et autres
Publié: (2023)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
par: de Berg, Sarita, et autres
Publié: (2023)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2023)

A Framework for Algorithm Stability
par: Meulemans, Wouter, et autres
Publié: (2017)

Light Spanners with Small Hop-Diameter
par: Bhore, Sujoy, et autres
Publié: (2025)

Dynamic Light Spanners in Doubling Metrics
par: Bhore, Sujoy, et autres
Publié: (2026)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
par: Buchin, Kevin, et autres
Publié: (2026)

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

Maintaining Light Spanners via Minimal Updates
par: Khodabandeh, Hadi, et autres
Publié: (2024)

The Contiguous Art Gallery Problem is in Θ(n log n)
par: de Berg, Sarita, et autres
Publié: (2025)

Range Counting Oracles for Geometric Problems
par: Driemel, Anne, et autres
Publié: (2025)

Spanner for the $0/1/\infty$ weighted region problem
par: Gudmundsson, Joachim, et autres
Publié: (2024)

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

Computing crossing numbers with topological and geometric restrictions
par: Hamm, Thekla, et autres
Publié: (2024)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
par: de Berg, Sarita, et autres
Publié: (2026)

Graph Spanners for Group Steiner Distances
par: Bilò, Davide, et autres
Publié: (2024)

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

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
par: Bartlmae, Simon, et autres
Publié: (2024)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)

Visibility Queries in Simple Polygons
par: Bhore, Sujoy, et autres
Publié: (2026)

Towards Instance-Optimal Euclidean Spanners
par: Le, Hung, et autres
Publié: (2024)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
par: de Berg, Mark, et autres
Publié: (2026)

On Approximability of Steiner Tree in $\ell_p$-metrics
par: Fleischmann, Henry, et autres
Publié: (2023)

Enclosing Points with Geometric Objects
par: Chan, Timothy M., et autres
Publié: (2024)

Duality between Lines and Points
par: Saxena, Sanjeev
Publié: (2025)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
par: Le, Hung, et autres
Publié: (2021)

Algorithms for Computing Closest Points for Segments
par: Wang, Haitao
Publié: (2024)

Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
par: Yang, Puhan, et autres
Publié: (2025)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
par: Förster, Henry, et autres
Publié: (2023)

Hitting Axis-Parallel Segments with Weighted Points
par: Raman, Rajiv, et autres
Publié: (2026)

Space Complexity of Euclidean Clustering
par: Zhu, Xiaoyi, et autres
Publié: (2024)

Algorithms for Distance Problems in Continuous Graphs
par: Cabello, Sergio, et autres
Publié: (2025)

The Parameterized Complexity of Extending Stack Layouts
par: Depian, Thomas, et autres
Publié: (2024)

Polyline Simplification has Cubic Complexity
par: Bringmann, Karl, et autres
Publié: (2018)

On the Complexity of the Ordered Covering Problem in Distance Geometry
par: Souza, Michael, et autres
Publié: (2025)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
par: Banik, Aritra, et autres
Publié: (2024)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
par: Park, Seongbin, et autres
Publié: (2026)

Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
par: Depian, Thomas, et autres
Publié: (2026)