arXiv subjects

Tsuri Farhana

Publications and source records attributed to Tsuri Farhana.

4 recordsLinked to original sources

arXiv2026

Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-offs

We study unlabeled MRMP for unit-disk robots in a polygonal environment. Although the problem is hard in general, polynomial-time solutions exist under appropriate separation assumptions on start and target positions. Banyassady et al.(SoCG'22) guarantee feasibility in simple polygons under start--start and target--target distances of at least $4$, and start--target distances of at least $3$, but without optimality guarantees. Solovey et al.(RSS'15) provide a near-optimal solution in general polygonal domains, under stricter conditions: start/target positions must have pairwise distance at least $4$, and at least $\sqrt{5}\approx2.236$ from obstacles. This raises the question of whether polynomial-time algorithms can be obtained in even more densely packed environments. In this paper we present a generalized algorithm that achieve different tradeoffs on the robots-separation $ρ$ and obstacles-separation $ω$, all significantly improving upon the state of the art. Specifically, we obtain polynomial-time constant-approximation algorithms to minimize the total path length when (i) $ρ=2\frac{2}{3}$ and $ω=1\frac{2}{3}$, or (ii) $ρ\approx3.291$ and $ω\approx1.354$. These solutions are weakly-monotone; we also provide a monotone solution requiring $ω=\approx1.614$ and $ρ=4$. We prove that monotone plans may not exist when $ω<1.614$, and weakly-monotone plans may not exist when $ω<1.354$. We then present tradeoffs between the separation bounds and the approximation factor, specifically achieving an (almost) optimal bound of $ρ=2$ at the cost of a linear approximation factor and requiring $ω=2$. This applies also for the labeled variant of MRMP, in which case we show a tight bound on $ω$. Finally, we show that without any robots-separation assumption, obstacles-separation of at least $1.5$ may be necessary for a solution to exist.

cs.CG↗

arXiv2026

A Dimension-Reducing Fréchet Simplification Oracle

Let $P$ be a polygonal curve with $n$ vertices in the plane. We construct a data structure of size $O(n \log n)$ suited for simplification queries of the following kind. Given a query line $\ell$ and an integer $k\ge1$, find a curve $Q$ on $\ell$ with at most $k$ vertices that minimizes the discrete Fréchet distance to $P$, among all such curves. Using our data structure, a query can be handled in $O(k^2 \log^3 n + k\log^4 n)$ time. More generally, a geometric tree $T$ on $n$ vertices in the plane can be preprocessed into a near-linear-size structure so that, given a pair $u$, $v$ of its vertices, a line $\ell$, and an integer $k\ge1$, one can find a curve $Q$ on $\ell$ with at most $k$ vertices that minimizes the discrete Fréchet distance to the path from $u$ to $v$ in $T$, in time $O(k^2 \mathop{polylog} n)$. For the general dimension-reduction problem, where $P$ is a curve in $\mathbb{R}^d$ ($d \ge 3$), $0 < \varepsilon_0 < 1$ is a real parameter, and a query specifies a $g$-flat $h$ ($1 \le g \le d-1$) and an integer $k \ge 1$, we construct a data structure of size $O(n\log n + f(\varepsilon_0) n)$, where $f(\varepsilon_0)=(1+1/\varepsilon_0)^{(d-1)/2}$, that allows us to find a curve $Q$ on $h$ with at most $k$ vertices, whose discrete Fréchet distance to $P$ is at most $1+\varepsilon_0$ times the distance of $Q^*$ to $P$, where $Q^*$ is such a curve that minimizes the distance to $P$. The query handling time is $O(f(\varepsilon_0) k^2 \log^2 n)$.

cs.CG↗

arXiv2024

Discrete Fréchet Distance Oracles

It is unlikely that the discrete Fréchet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to construct data structures (distance oracles) of near-linear size that support efficient distance queries with respect to $P$ in sublinear time. Since there is evidence that this is impossible for query curves of length $Θ(n^α)$, for any $α> 0$, we focus on query curves of (small) constant length, for which we are able to devise distance oracles with the desired bounds. We extend our tools to handle subcurves of the given curve, and even arbitrary vertex-to-vertex subcurves of a given geometric tree. That is, we construct an oracle that can quickly compute the distance between a short polygonal path (the query) and a path in the preprocessed tree between two query-specified vertices. Moreover, we define a new family of geometric graphs, $t$-local graphs (which strictly contains the family of geometric spanners with constant stretch), for which a similar oracle exists: we can preprocess a graph $G$ in the family, so that, given a query segment and a pair $u,v$ of vertices in $G$, one can quickly compute the smallest discrete Fréchet distance between the segment and any $(u,v)$-path in $G$. The answer is exact, if $t=1$, and approximate if $t>1$.

cs.CG↗

arXiv2023

Spanners under the Hausdorff and Fréchet Distances

We initiate the study of spanners under the Hausdorff and Fréchet distances. We show that any $t$-spanner of a planar point-set $S$ is a $\frac{\sqrt{t^2-1}}{2}$-Hausdorff-spanner and a $\min\{\frac{t}{2},\frac{\sqrt{t^2-t}}{\sqrt{2}}\}$-Fréchet spanner. We also prove that for any $t > 1$, there exist a set of points $S$ and an $\varepsilon_1$-Hausdorff-spanner of $S$ and an $\varepsilon_2$-Fréchet-spanner of $S$, where $\varepsilon_1$ and $\varepsilon_2$ are constants, such that neither of them is a $t$-spanner.

cs.CG↗