Imagen de Portada

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	van der Horst, Thijs, van Kreveld, Marc, Ophelders, Tim, Speckmann, Bettina
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Faster Fréchet Distance Approximation through Truncated Smoothing
por: van der Horst, Thijs, et al.
Publicado: (2024)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
por: van der Horst, Thijs, et al.
Publicado: (2025)

Faster, Deterministic and Space Efficient Subtrajectory Clustering
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Robust Bichromatic Classification using Two Lines
por: Glazenburg, Erwin, et al.
Publicado: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
por: Beurskens, Thijs, et al.
Publicado: (2023)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
por: Picarella, Gianmarco, et al.
Publicado: (2025)

Locally Correct Interleavings between Merge Trees
por: Beurskens, Thijs, et al.
Publicado: (2025)

A Framework for Algorithm Stability
por: Meulemans, Wouter, et al.
Publicado: (2017)

Computing the Fréchet Distance When Just One Curve is $c$-Packed: A Simple Almost-Tight Algorithm
por: Conradi, Jacobus, et al.
Publicado: (2025)

Circularity and Symmetries of $p$ and $p^{2}$-polygons
por: Haag, Rolf
Publicado: (2025)

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

An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes
por: de Verdière, Éric Colin, et al.
Publicado: (2021)

Faster algorithms on linear delta-matroids
por: Koana, Tomohiro, et al.
Publicado: (2024)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
por: Kowaluk, Miroslaw, et al.
Publicado: (2025)

Faster shortest-path algorithms using the acyclic-connected tree
por: Stefansson, Elis, et al.
Publicado: (2025)

Caracterisation of Frechet differentiability norm for dual complex Banach spaces
por: Daher, Mohammad
Publicado: (2024)

Revisiting the Fréchet distance between piecewise smooth curves
por: Conradi, Jacobus, et al.
Publicado: (2024)

Loop unrolling of UCA models: distance labeling
por: Soulignac, Francisco J, et al.
Publicado: (2022)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

Are giants in random digraphs `almost' local?
por: van der Hofstad, Remco, et al.
Publicado: (2024)

A polynomial-time algorithm for recognizing high-bandwidth graphs
por: Varona, Luis M. B.
Publicado: (2026)

Bacterial standing stock and biomass measured on water bottle samples during POLARSTERN cruise ANT-X/6
por: Smetacek, Victor, et al.
Publicado: (1997)

Liquid Amortization: Proving Amortized Complexity with LiquidHaskell (Functional Pearl)
por: van Brügge, Jan
Publicado: (2024)

Customizable Contraction Hierarchies -- A Survey
por: Bläsius, Thomas, et al.
Publicado: (2025)

Photosynthetically active radiation (PAR) measured on water bottle samples during POLARSTERN cruise ANT-X/6
por: Smetacek, Victor, et al.
Publicado: (1997)

A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique
por: Lingas, Andrzej
Publicado: (2024)

On λ-backbone coloring of cliques with tree backbones in linear time
por: Michalik, Krzysztof, et al.
Publicado: (2021)

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching
por: Donkiewicz, Tim, et al.
Publicado: (2026)

Automatic Identification of Traps in Molecular Charge Transport Networks of Organic Semiconductors
por: Chen, Zhongquan, et al.
Publicado: (2024)

The characteristic polynomials of $r$-uniform hypercycles with length $l$
por: Bo, Dong, et al.
Publicado: (2025)

Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
por: Díaz-Báñez, J. M., et al.
Publicado: (2022)

Diameter Constraints in 2-distance Graphs
por: Al-saadi, Oleksiy, et al.
Publicado: (2025)

An algorithm for two-dimensional mesh generation based on the pinwheel tiling
por: Ganguly, Pritam, et al.
Publicado: (2004)

Aperiodic sets of three types of convex polygons
por: Sugimoto, Teruhisa
Publicado: (2024)

Bacteria abundance and biomass measured on water bottle samples during POLARSTERN cruise ANT-X/6
por: Smetacek, Victor, et al.
Publicado: (1997)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
por: Cheng, Cong-Dian
Publicado: (2017)

Nutrients and pigments measured on water bottle samples during POLARSTERN cruise ANT-X/6
por: Smetacek, Victor, et al.
Publicado: (1997)

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

Integrated primary production by 14C during POLARSTERN cruise ANT-X/6
por: Smetacek, Victor, et al.
Publicado: (1997)

Photosynthetically active radiation (PAR) and primary production (PP) measured on water bottle samples during POLARSTERN cruise ANT-X/6
por: Smetacek, Victor, et al.
Publicado: (1997)