Imagen de Portada

Realizing Metric Spaces with Convex Obstacles

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kisfaludi-Bak, Sándor, Theocharous, Leonidas
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2020)

Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)

A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2023)

Recognizing Subgraphs of Regular Tilings
por: Ingervo, Eliel, et al.
Publicado: (2026)

Shortest Paths, Convexity, and Treewidth in Regular Hyperbolic Tilings
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2026)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
por: de Berg, Mark, et al.
Publicado: (2026)

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

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
por: de Berg, Mark, et al.
Publicado: (2024)

Euclidean TSP in Narrow Strips
por: Alkema, Henk, et al.
Publicado: (2020)

Hardness of Median and Center in the Ulam Metric
por: Fischer, Nick, et al.
Publicado: (2025)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
por: Goodrich, Michael T., et al.
Publicado: (2024)

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

On Saxe's theorems about the complexity of the Distance Geometry Problem
por: Kupperschmitt, Maël, et al.
Publicado: (2025)

Minimum Selective Subset on Some Graph Classes
por: Manna, Bubai
Publicado: (2025)

Counting Triangulations of Fixed Cardinal Degrees
por: Chambers, Erin, et al.
Publicado: (2025)

Push-1 is PSPACE-complete, and the automated verification of motion planning gadgets
por: DeStefano, Zachary, et al.
Publicado: (2025)

Query-Efficient Fixpoints of $\ell_p$-Contractions
por: Haslebacher, Sebastian, et al.
Publicado: (2025)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
por: Gibor, Daniel
Publicado: (2025)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
por: Silva, Lucas de Oliveira, et al.
Publicado: (2025)

Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
por: Manna, Bubai
Publicado: (2025)

On the complexity of embedding in graph products
por: Biedl, Therese, et al.
Publicado: (2023)

Geometric Bipartite Matching is in NC
por: Bhore, Sujoy, et al.
Publicado: (2024)

Complexity of 2D Snake Cube Puzzles
por: MIT Hardness Group, et al.
Publicado: (2024)

The Parameterized Complexity of Geometric 1-Planarity
por: Firbas, Alexander
Publicado: (2026)

Constrained Boundary Labeling
por: Depian, Thomas, et al.
Publicado: (2024)

On the hardness of finding normal surfaces
por: Burton, Benjamin A., et al.
Publicado: (2019)

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
por: Boomari, Hossein, et al.
Publicado: (2018)

Pathways to Tractability for Geometric Thickness
por: Depian, Thomas, et al.
Publicado: (2024)

The Complexity of Drawing Graphs on Few Lines and Few Planes
por: Chaplick, Steven, et al.
Publicado: (2016)

On the complexity of covering points by guillotine cuts
por: Garijo, Delia, et al.
Publicado: (2026)

Undecidability of Translational Tiling of the 4-dimensional Space with a Set of 4 Polyhypercubes
por: Yang, Chao, et al.
Publicado: (2024)

Undecidability of Translational Tiling of the 3-dimensional Space with a Set of 6 Polycubes
por: Yang, Chao, et al.
Publicado: (2024)

How Hard is it to be a Star? Convex Geometry and the Real Hierarchy
por: Schaefer, Marcus, et al.
Publicado: (2025)

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Undecidability of Translational Tiling with Three Tiles
por: Yang, Chan, et al.
Publicado: (2024)

Translational Aperiodic Sets of 7 Polyominoes
por: Yang, Chao, et al.
Publicado: (2024)

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
por: Chan, Timothy M., et al.
Publicado: (2026)