:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Gudmundsson, Joachim, Sha, Yuan, Wong, Sampson
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry
Acceso en línea:	https://arxiv.org/abs/2603.22948
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

A WSPD, Separator and Small Tree Cover for c-packed Graphs
por: Deryckere, Lindsey, et al.
Publicado: (2025)

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

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

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

Minimum Exposure Motion Planning
por: de Berg, Sarita, et al.
Publicado: (2026)

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

Oriented Spanners
por: Buchin, Kevin, et al.
Publicado: (2023)

On approximating shortest paths in weighted triangular tessellations
por: Bose, Prosenjit, et al.
Publicado: (2021)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
por: van Renssen, Andrè, et al.
Publicado: (2022)

Approximating shortest paths in weighted square and hexagonal meshes
por: Bose, Prosenjit, et al.
Publicado: (2024)

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

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

Shortest Paths of Mutually Visible Robots
por: Alsaedi, Rusul J., et al.
Publicado: (2023)

The Mutual Visibility Problem for Fat Robots with Lights
por: Alsaedi, Rusul J., et al.
Publicado: (2022)

Pattern Formation for Fat Robots with Lights
por: Alsaedi, Rusul J., et al.
Publicado: (2023)

Pattern Formation for Fat Robots with Memory
por: Alsaedi, Rusul J., et al.
Publicado: (2023)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
por: Gudmundsson, Joachim, et al.
Publicado: (2022)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
por: de Berg, Sarita, et al.
Publicado: (2026)

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

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

Property Testing of Curve Similarity
por: Afshani, Peyman, et al.
Publicado: (2025)

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

Data Structures for Approximate Discrete Fréchet Distance
por: van der Hoog, Ivor, et al.
Publicado: (2022)

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

Theoretical analysis of beaconless geocast protocols in 1D
por: Gudmundsson, Joachim, et al.
Publicado: (2025)

Instance-Optimal Imprecise Convex Hull
por: de Berg, Sarita, et al.
Publicado: (2025)

Monitoring graph edges via shortest paths: computational complexity and approximation algorithms
por: Colli, Giordano
Publicado: (2025)

Computing Oriented Spanners and their Dilation
por: Buchin, Kevin, et al.
Publicado: (2024)

Passage-traversing optimal path planning with sampling-based algorithms
por: Huang, Jing, et al.
Publicado: (2025)

On graphs coverable by k shortest paths
por: Dumas, Maël, et al.
Publicado: (2022)

Non-Euclidean Erdős-Anning Theorems
por: Eppstein, David
Publicado: (2024)

Unavoidable patterns and plane paths in dense topological graphs
por: Keszegh, Balázs, et al.
Publicado: (2025)

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

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

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

Searching in Euclidean Spaces with Predictions
por: Cabello, Sergio, et al.
Publicado: (2024)