Related papers: A Combinatorial Bound for Beacon-based Routing in …
We consider various problems related to finding points in $\Q^{2}$ and in $\Q^{3}$ which lie at rational distance from the vertices of some specified geometric object, for example, a square or rectangle in $\Q^{2}$, and a cube or…
We study a diffusion approximation for a model of stochastic motion of a particle in one spatial dimension. The velocity of the particle is constant but the direction of the motion undergoes random changes with a Poisson clock. Moreover,…
We study Poincare recurrence of chaotic attractors for regions of finite size. Contrary to the standard case, where the size of the recurrent regions tends to zero, the measure is not supported anymore solely by unstable periodic orbits…
Oriented object detection in aerial images is a challenging task as the objects in aerial images are displayed in arbitrary directions and are usually densely packed. Current oriented object detection methods mainly rely on two-stage…
Coordinate-based networks have emerged as a powerful tool for 3D representation and scene reconstruction. These networks are trained to map continuous input coordinates to the value of a signal at each point. Still, current architectures…
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robots. Consider a line segment $[0,I]$ and a set of $n$ mobile robots $r_1,r_2,..., r_n$ placed at one of its endpoints. Each robot has a {\em…
While rectangular and box-shaped objects dominate the classic discourse of theoretic investigations, a fascinating frontier lies in packing more complex shapes. Given recent insights that convex polygons do not allow for constant…
Mobile robot navigation is typically regarded as a geometric problem, in which the robot's objective is to perceive the geometry of the environment in order to plan collision-free paths towards a desired goal. However, a purely geometric…
We study trajectories of d-dimensional Brownian Motion in Poissonian potential up to the hitting time of a distant hyper-plane. Our Poissonian potential V can be associated to a field of traps whose centers location is given by a Poisson…
A ground-to-air free-space optical link is studied for a hovering unmanned aerial vehicle (UAV) having multiple rotors. For this UAV, a four-quadrant array of photodetectors is used at the optical receiver to alleviate the adverse effect of…
Bump attractors are wandering localised patterns observed in in vivo experiments of spatially-extended neurobiological networks. They are important for the brain's navigational system and specific memory tasks. A bump attractor is…
We study the problem of colouring the vertices of a polygon, such that every viewer in it can see a unique colour. The goal is to minimise the number of colours used. This is also known as the conflict-free chromatic guarding problem with…
We derive large- and moderate-deviation results in random networks given as planar directed navigations on homogeneous Poisson point processes. In this non-Markovian routing scheme, starting from the origin, at each consecutive step a…
We study the problem of planning paths for a team of robots for visually monitoring an environment. Our work is motivated by surveillance and persistent monitoring applications. We are given a set of target points in a polygonal environment…
We implemented a system able to locate people indoor, with the purpose of providing assistive services. Such approach is particularly important for the Art, for providing information on exhibitions, art galleries and museums, and to allow…
We investigate the online exploration problem (aka covering) of a short-sighted mobile robot moving in an unknown cellular environment with hexagons and triangles as types of cells. To explore a cell, the robot must enter it. Once inside,…
The {\it largest angle bisection} procedure is the operation which partitions a given triangle, $T$, into two smaller triangles by constructing the angle bisector of the largest angle of $T$. Applying the procedure to each of these two…
Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…
We propose a routing algorithm that takes a sequence of vectors and computes a new sequence with specified length and vector size. Each output vector maximizes "bang per bit," the difference between a net benefit to use and net cost to…
In the orthogonal range reporting problem we must pre-process a set $P$ of multi-dimensional points, so that for any axis-parallel query rectangle $q$ all points from $q\cap P$ can be reported efficiently. In this paper we study the query…