Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.05523

Sliding Squares in Parallel

Hugo A. Akitaya·Sándor P. Fekete·Peter Kramer·Saba Molaei·Christian Rieck·Frederick Stock·Tobias Wallner
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider algorithmic problems motivated by modular robotic reconfiguration in the sliding square model, in which we are given $n$ square-shaped modules in a (labeled or unlabeled) start configuration and need to find a schedule of sliding moves to transform it into a desired goal configuration, maintaining connectivity of the configuration at all times. Recent work has aimed at minimizing the total number of moves, resulting in fully sequential schedules that perform reconfiguration in $\mathcal{O}(nP)$ moves for arrangements of bounding box perimeter size $P$, or a number of moves linear in the sum of module coordinates in the start and target arrangements. We extend the model to leverage the possibility of parallel motion, thereby reducing worst-case makespans by a factor linear in $n$. Our work presents tight results both in terms of complexity and algorithms: We show that deciding the existence of a single parallel reconfiguration step that solves an instance is NP-complete for unlabeled modules, but can be solved efficiently in the labeled setting. Nevertheless, deciding whether a labeled instance can be solved in two parallel steps is NP-complete. Finally, we describe an algorithm to perform in-place reconfiguration in worst-case optimal $\mathcal{O}(P)$ parallel steps for the unlabeled setting. This algorithm has a straight-forward extension to the labeled setting with slight relaxations to either the reconfiguration time or space constraint.

Explore related subjects

cs.CGcs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hugo A. Akitaya, Sándor P. Fekete, Peter Kramer, Saba Molaei, Christian Rieck, Frederick Stock, Tobias Wallner. 2025-10-08. Sliding Squares in Parallel. https://arxiv.org/abs/2412.05523

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

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

Low-Dimensional Embeddings for Gaussian Kernels on Manifolds

The Gaussian kernel is a widely used similarity measure underlying kernel methods such as kernel PCA and spectral clustering, but computing Gaussian kernel distances for many pairs of points can be expensive. Using Random Fourier Features (RFF), Chen and Phillips [ALT 2017] showed that for points in a $d$-dimensional Euclidean ball in ${\mathbb R}^N$, $t=Ω((d/\varepsilon^2)\log(dR/\varepsilon))$ features suffice to preserve all pairwise Gaussian kernel distances within a $(1\pm\varepsilon)$ factor with high probability. We establish a uniform relative-error embedding theorem for the more general setting of an arbitrary positive-reach submanifold $\mathcal M\subset{\mathbb R}^N$ of intrinsic dimension $d$. We show that $t=O((d/\varepsilon^2)\log(\operatorname{vol}(\mathcal M)^2N^{2d}/(\operatorname{vol}(B_1^d(0))^2\operatorname{rch}(\mathcal M)^{2d}\varepsilon^{2d+1}δ)))$, or approximately $O((d^2/\varepsilon^2)(\log N+\log(1/(\varepsilonδ))))$, RFFs suffice, with probability $1-δ$, to preserve the Gaussian kernel distance between every pair of manifold points up to relative error $\varepsilon$. Thus the bound depends only logarithmically on the ambient dimension and on manifold parameters such as volume and reach, while retaining the $1/\varepsilon^2$ Euclidean rate. We also prove a topological consequence: under the same RFF embedding, persistent homology is preserved in the sense that weighted Cech and Rips filtrations built from Gaussian kernel power distance are $(1\pm\varepsilon_\star)$-interleaved, where $\varepsilon_\star$ accounts for both distance distortion and kernel-weight approximation.

cs.CG↗
arXiv2026

Perfectly Guarding Straits: Exact Algorithms for Weak Visibility Polygons

The Art Gallery Problem (AGP) asks for the fewest guards that see all of a simple polygon. It is $\exists\mathbb{R}$-complete, hence NP-hard. We show that for a particular class of polygons, confining guards to a single edge makes AGP exactly and efficiently solvable. We call this the Strait Guarding Problem (SGP). Its input is a weak visibility polygon (WVP): a simple polygon where every point is seen from some point of one fixed edge, the base. SGP places the fewest guards on the base that jointly see the whole polygon. First, a structural fact: guards on the base edge that cover the boundary already cover the entire interior, turning a two-dimensional covering problem into a one-dimensional one. Our main result is the Witness-Guard Algorithm, which solves SGP exactly in $O((n + \mathrm{OPT} \cdot ρ)(\log n + \log \mathrm{OPT}))$ time, where $ρ$ is the number of reflex vertices in the WVP and OPT is the minimum number of guards. It is output-sensitive and certifies optimality by a witness set of size OPT derived from its output. We also study the guarding-the-vertex version and prove a tight $Θ(n \log n)$ bound, with the lower bound following from Sorting. As a corollary of SGP, we obtain two results for altitude terrain guarding (ATG), a special case that SGP generalizes. We give a linear-time perfect-guarding algorithm, improving the previous $O(n^2 \log n)$ bound of Daescu, Friedrichs, Malik, Polishchuk and Schmidt. We also resolve their problem on the minimum guarding altitude, in $O(nk + k^2 \log k)$ time, improving on the $O(k^2 λ_{k-1}(n) \log n)$ bound of Kang, Kim and Ahn.

cs.CG↗