Cover Image

Searching in Euclidean Spaces with Predictions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cabello, Sergio, Giannopoulos, Panos
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

Delaunay Triangulations with Predictions
by: Cabello, Sergio, et al.
Published: (2026)

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
by: Gao, Jie, et al.
Published: (2025)

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

Multipacking in Euclidean Metric Space
by: Das, Arun Kumar, et al.
Published: (2024)

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
by: de Berg, Mark, et al.
Published: (2025)

Space Complexity of Euclidean Clustering
by: Zhu, Xiaoyi, et al.
Published: (2024)

Non-Euclidean Erdős-Anning Theorems
by: Eppstein, David
Published: (2024)

A characterisation of Euclidean normed planes via bisectors
by: Sánchez, Javier Cabello, et al.
Published: (2024)

Packing d-dimensional balls into a d+1-dimensional container
by: Alt, Helmut, et al.
Published: (2021)

Metricizing the Euclidean Space towards Desired Distance Relations in Point Clouds
by: Rass, Stefan, et al.
Published: (2022)

Optimal Euclidean Tree Covers
by: Chang, Hsien-Chih, et al.
Published: (2024)

Euclidean TSP in Narrow Strips
by: Alkema, Henk, et al.
Published: (2020)

Long Plane Trees
by: Cabello, Sergio, et al.
Published: (2021)

Better Late than Never: the Complexity of Arrangements of Polyhedra
by: Aronov, Boris, et al.
Published: (2025)

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

The Euclidean $k$-Matching Problem is NP-hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)

Embedding Graphs as Euclidean kNN-Graphs
by: Schibler, T., et al.
Published: (2025)

Covering the Euclidean Plane by a Pair of Trees
by: Le, Hung, et al.
Published: (2025)

Tree covers of size $2$ for the Euclidean plane
by: Bikeev, Artur, et al.
Published: (2025)

Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)

Biharmonic Hypersurfaces in Euclidean Spaces
by: Bibi, Hiba, et al.
Published: (2024)

Towards Non-Euclidean Foundation Models: Advancing AI Beyond Euclidean Frameworks
by: Yang, Menglin, et al.
Published: (2025)

Connected Matchings
by: Aichholzer, Oswin, et al.
Published: (2024)

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
by: Le, Hung, et al.
Published: (2021)

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

Medial Axis in Pseudo-Euclidean Spaces
by: Białożyt, Adam
Published: (2025)

Eliminating Crossings in Ordered Graphs
by: Agrawal, Akanksha, et al.
Published: (2024)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)

Euclidean Steiner Shallow-Light Trees in Higher Dimensions
by: Frost, Devin, et al.
Published: (2026)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
by: Cabello, Sergio, et al.
Published: (2021)

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

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

Vietoris--Rips Shadow for Euclidean Graph Reconstruction
by: Komendarczyk, Rafal, et al.
Published: (2025)

Efficient Neighbourhood Search in 3D Point Clouds Through Space-Filling Curves and Linear Octrees
by: Viñambres, Pablo D., et al.
Published: (2026)

Non-holomorphic Kaehler submanifolds of Euclidean space
by: Chion, Sergio, et al.
Published: (2023)

Solving Euclidean Problems by Isotropic Initialization
by: Yorov, Khusrav, et al.
Published: (2025)

Approximating Euclidean Shallow-Light Trees
by: Le, Hung, et al.
Published: (2025)

Euclidean k-center Fair Clusterings
by: Moritaka, Ayano, et al.
Published: (2025)

Functional perimeter and the dimensional Brunn-Minkowski inequality for log-concave measures
by: Eskenazis, Alexandros, et al.
Published: (2026)

Faster Approximation Scheme for Euclidean $k$-TSP
by: van Wijland, Ernest, et al.
Published: (2023)