Related papers: Billiard Lawn Mowers
We prove new necessary and sufficient conditions to carry out a compact linearization approach for a general class of binary quadratic problems subject to assignment constraints as it has been proposed by Liberti in 2007. The new conditions…
We consider polygonal billiards and we show the uniqueness of coding of non-periodic billiard trajectories in polygons whose holes have non-zero minimal diameters, generalising a theorem of Galperin, Kr\"uger and Troubetzkoy.
The study of polygonal billiards, particularly those in the regular pentagon, has been the subject of two recent papers. One of these papers approaches the problem of discovering the periodic trajectories on the pentagon by identifying…
The paper establishes the property of splittability of billiard boundary sequences in n dimensional cube into subsequences of fractional parts. This reveals a new property of integrable and weak perturbated Hamilton systems: under a simple…
We consider systems of "pinned balls," i.e., balls that have fixed positions and pseudo-velocities. Pseudo-velocities change according to the same rules as those for velocities of totally elastic collisions between moving balls. The times…
Finding shortest paths in a given network (e.g., a computer network or a road network) is a well-studied task with many applications. We consider this task under the presence of an adversary, who can manipulate the network by perturbing its…
Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iteratively solving optimization problems, the so-called separation. Instead, we reframe the problem of finding good cutting planes as a continuous…
The billiard problem of statistical physics is considered in a new geometric approach with a symmetric phase space. The structure and topological features of typical billiard phase portrait are defined. The connection between geometric,…
Given a random map (T_1, T_2, T_3, T_4, p_1, p_2, p_3, p_4), we define a random billiard map on a surface of constant curvature (Euclidean plane, hyperbolic plane, or the sphere). The Liouville measure is invariant for this billiard map.…
We study the stability properties of orbits in dispersing billiards in a homogeneous magnetic field by using a modified formalism based on the Bunimovich-Sinai curvature (horocycle method). We identify simple periodic orbits that can be…
We consider the class of dispersing billiard systems in the plane formed by removing three convex analytic scatterers satisfying the non-eclipse condition. The collision map in this system is conjugated to a subshift, providing a natural…
In this paper, for the first time, there is comprehensively tackling the problem of biomechanical optimization of a sport of situation such as judo. Starting from the optimization of more simple sports, optimization of this kind of complex…
It has long been known that cylindrical algebraic decompositions (CADs) can in theory be used for robot motion planning. However, in practice even the simplest examples can be too complicated to tackle. We consider in detail a "Piano…
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…
We consider the dual billiard map with respect to a smooth strictly convex closed hypersurface in linear 2m-dimensional symplectic space and prove that it has at least 2m distinct 3-periodic orbits.
We present a link between billiards in convex plane domains and Hofer's geometry, an area of symplectic topology. For smooth strictly convex billiard tables, we prove that the Hofer distance between the corresponding billiard ball maps…
The problem of linear and circular permutations of n identical objects in m boxes, where a limit l is imposed on the number of objects in a box, is considered. In the linear case, where the boxes are arranged as a row, two methods of…
We study periodic wind-tree models, billiards in the plane endowed with $\mathbb{Z}^2$-periodically located identical connected symmetric right-angled obstacles. We exhibit effective asymptotic formulas for the number of (isotopy classes…
Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theoretical computer…
We introduce a new equivalence relation on the set of all polygonal billiards. We say that two billiards (or polygons) are order equivalent if each of the billiards has an orbit whose footpoints are dense in the boundary and the two…