Related papers: Snell meets Fagnano. Path optimization through an …
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula {\phi} over edges of a fixed-size graph, the objective is to find a model of {\phi} that corresponds to a graph that…
We describe the periodic orbits of the prefractal Koch snowflake billiard (the nth inner rational polygonal approximation of the Koch snowflake billiard). In the case of the finite (prefractal) billiard table, we focus on the direction…
We consider extending visibility polygon $(VP)$ of a given point $q$ $(VP(q))$, inside a simple polygon $\P$ by converting some edges of $\P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add at…
We study periodic infinite billiards in the plane. We show that for rational models, some particular obstacles can be added periodically, so that the billiard flow in the resulting table is recurrent in almost every direction.
Given a polygon $P$ in the plane that can be translated, rotated and enlarged arbitrarily inside a unit square, the goal is to find a set of lines such that at least one of them always hits $P$ and the number of lines is minimized. We prove…
We study polygonal billiards with reflection laws contracting the reflected angle towards the normal. It is shown that if a polygon does not have parallel sides facing each other, then the corresponding billiard map has finitely many…
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge…
The classical Apollonius' problem is to construct circles that are tangent to three given circles in a plane. This problem was posed by Apollonius of Perga in his work "Tangencies". The Sylvester problem, which was introduced by the English…
We investigate chaotic scattering on an attractive step potential with a quadrupolar deformation. The phase space features of the bound billiard are studied by using the notion of symmetry lines to find periodic orbits. We show that the…
If D is a rational polygon, then the associated rational billiard table is given by \Omega(D). Such a billiard table is well understood. If F is a closed fractal curve approximated by a sequence of rational polygons, then the corresponding…
A periodic orbit on a frictionless billiard table is a piecewise linear path of a billiard ball that begins and ends at the same point with the same angle of incidence. The period of a primitive periodic orbit is the number of times the…
We apply periodic orbit theory to a two-dimensional non-integrable billiard system whose boundary is varied smoothly from a circular to an equilateral triangular shape. Although the classical dynamics becomes chaotic with increasing…
Given a road network modelled as a planar straight-line graph $G=(V,E)$ with $|V|=n$, let $(u,v)\in V\times V$, the shortest path (distance) between $u,v$ is denoted as $\delta_G(u,v)$. Let $\delta(G)=\max_{(u,v)}\delta_G(u,v)$, for…
Closed billiard trajectories in a polygon in the hyperbolic plane can be coded by the order in which they hit the sides of the polygon. In this paper, we consider the average length of cyclically related closed billiard trajectories in…
The minimum completion (fill-in) problem is defined as follows: Given a graph family $\mathcal{F}$ (more generally, a property $\Pi$) and a graph $G$, the completion problem asks for the minimum number of non-edges needed to be added to $G$…
The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…
The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ between every pair of vertices is at most $k$ times their…
In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over all orientations, that encloses a set $P$ of $n$ input…
We consider the set of polygons all of whose sides are vertical or horizontal with fixed combinatorics (for example all the figure "L"s). We show that there is a dense G $\delta$ subset of such polygons such that for each polygon in this G…
We prove that there exists a residual set of (non-rational) polygons such the billiard flow is weakly mixing with respect to the Liouville measure (on the unit tangent bundle to the billiard). This follows, via a Baire category argument,…