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

Let $P$ be a polygon with $k$ vertices. Let $R$ and $B$ be two simple, interior disjoint curves on the boundary of $P$, with $n$ and $m$ vertices. We show how to compute the Fr\'echet distance between $R$ and $B$ using the geodesic $L_1$-distance in $P$ in $\mathcal{O}(k \log nm + (n+m) (\log^2 nm \log k + \log^4 nm))$ time.

Publication Details

Journal
ArXiv.org
Published
2025-04-18
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

ArXiv.org
Computational Geometry and Mesh Generation
article

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

article en

Abstract

Let $P$ be a polygon with $k$ vertices. Let $R$ and $B$ be two simple, interior disjoint curves on the boundary of $P$, with $n$ and $m$ vertices. We show how to compute the Fr\'echet distance between $R$ and $B$ using the geodesic $L_1$-distance in $P$ in $\mathcal{O}(k \log nm + (n+m) (\log^2 nm \log k + \log^4 nm))$ time.

ArXiv.org
Openalex Percentile: Top 33%
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.