相关论文: Billiard Lawn Mowers

For a given polygonal region $P$, the Lawn Mowing Problem (LMP) asks for a shortest tour $T$ that gets within Euclidean distance 1 of every point in $P$; this is equivalent to computing a shortest tour for a unit-disk cutter $C$ that covers…

In any periodic direction on the regular pentagon billiard table, there exists two combinatorially different billiard paths, with one longer than the other. For each periodic direction, McMullen asked if one could determine whether the…

Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…

We study polygonal billiards with one-sided vertical mirror scattered on a square billiard table. We associate trajectories of these kinds of billiards with double rotations and study orbit behavior and questions of complexity.

In this paper the problem of estimating the number of periodical billiard trajectories is considered. The main result is the theorem on Morse theory for periodical billiard trajectories.

Thanks to the rapid evolvement of robotic technologies, robot mowing is emerging to liberate humans from the tedious and time-consuming landscape work. Traditionally, robot mowing is perceived as a "Coverage Path Planning" problem, with a…

The renowned Fagnano problem asks for the inscribed triangle of minimal perimeter within a given reference triangle. Equivalently, it seeks a billiard trajectory inside the triangle that closes after three reflections. In this note, we…

The winning rule of billiards is to drive the billiard ball on the table into the designated holes. We try to study the trajectory of the billiard ball, so that we can predict the direction of the ball. For rational slopes, we got cutting…

We obtain an upper bound of the number of collisions of any billiard trajectory in a polyhedral angle in terms of the minimal eigenvalue of a positive definite matrix which characterizes the angle. Elements of the matrix are scalar products…

We study the geometry of billiard orbits on rectangular billiards. A truncated billiard orbit induces a partition of the rectangle into polygons. We prove that thirteen is a sharp upper bound for the number of different areas of these…

We study periodic billiard trajectories on a compact Riemannian manifold with boundary, by applying Morse theory to Lagrangian action functionals on the loop space of the manifold. Based on the approximation method due to Benci-Giannoni, we…

We give an optical physicist view of the problem of the trajectories in a polygonal billiard using only basic facts of Optics and the theory of functions of a complex variable. This approach allow us to stablish a certain correspondence…

A billiard is a dynamical system in which a particle alternates between motion in a straight line and specular reflection from a boundary. For billiards in non-convex areas bounded by segments of confocal quadrics are studied. The topology…

We show that the complexity of the billiard in a typical polygon grows cubically and the number of saddle connections grows quadratically along certain subsequences. It is known that the set of points whose first n-bounces hits the same…

In this paper we define and study the billiard problem on bounded regions on surfaces of constant curvature. We show that this problem defines a 2-dimensional conservative and reversible dynamical system, defined by a Twist diffeomorphism,…

We examine the possible trajectories of a classical particle, trapped in a two-dimensional infinite rectangular well, using the Hamilton-Jacobi equation. We observe that three types of trajectories are possible: periodic orbits, open orbits…

We investigate a combinatorial optimization problem that involves patrolling the edges of an acute triangle using a unit-speed agent. The goal is to minimize the maximum (1-gap) idle time of any edge, which is defined as the time gap…

The quadratic cycle cover problem is the problem of finding a set of node-disjoint cycles visiting all the nodes such that the total sum of interaction costs between consecutive arcs is minimized. In this paper we study the linearization…

For every quadrilateral sufficiently close to a rectangle, we shall show that it possess a periodic billiard path. This is an REU work done at ICERM in Summer 2012.

We present an efficient method to solve scattering problems in two-dimensional open billiards with two leads and a complicated scattering region. The basic idea is to transform the scattering region to a rectangle, which will lead to…