Related papers: Snell meets Fagnano. Path optimization through an …
We study the classical motion in bidimensional polygonal billiards on the sphere. In particular we investigate the dynamics in tiling and generic rational and irrational equilateral triangles. Unlike the plane or the negative curvature…
The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, a decision maker has to choose in each…
We explore the triangle outer billiards map in points at infinity in the hyperbolic plane, focusing on the rotation number. Building on Dogru and Tabachnikov's work, which established the conditions for triangles where the rotation number…
We establish a connection between capillary floating in neutral equilibrium and the billiard ball problem. This allows us to reduce the question of floating in neutral equilibrium at any orientation with a prescribed contact angle for…
Visibility graph of a simple polygon is a graph with the same vertex set in which there is an edge between a pair of vertices if and only if the segment through them lies completely inside the polygon. Each pair of adjacent vertices on the…
We give a tree structure on the set of all periodic directions on the golden L, which gives an associated tree structure on the set of periodic directions for the pentagon billiard table and double pentagon surface. We use this to give the…
Rational polygonal billiards are one of the key models among the larger class of pseudo-integrable billiards. Their billiard flow may be lifted to the geodesic flow on a translation surface. Whereas such classical billiards have been much…
We consider billiard systems within compact domains bounded by confocal conics on a hyperboloid of one sheet in the Minkowski space. We derive conditions for elliptic periodicity for such billiards. We describe the topology of those…
We provide several applications of the linearization problem of a binary quadratic problem. We propose a new lower bounding strategy, called the linearization-based scheme, that is based on a simple certificate for a quadratic function to…
We classify nonsingular symmetric periodic trajectories (SPTs) of billiards inside ellipsoids of R^{n+1} without any symmetry of revolution. SPTs are defined as periodic trajectories passing through some symmetry set. We prove that there…
We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but…
This article presents a new method to calculate eigenvalues of right triangle billiards. Its efficiency is comparable to the boundary integral method and more recently developed variants. Its simplicity and explicitness however allow new…
We present analytical and numerical solutions of the Lippmann-Schwinger equation for the scattered wavefunctions generated by confocal parabolic billiards and parabolic segments with various $\delta$-type potential-strength functions. The…
A study of the quantum triangular billiard requires consideration of a boundary value problem for the Green's function of the Laplacian on a trianglar domain. Our main result is a reformulation of this problem in terms of coupled…
We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…
In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…
A binary tanglegram is a pair <S,T> of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics or software engineering, it is required…
We investigate minimal-perimeter configurations of two finite sets of points on the square lattice. This corresponds to a lattice version of the classical double-bubble problem. We give a detailed description of the fine geometry of…
We study compact minimal surfaces in the 3-sphere which are constructed by successive reflections from a minimal $n$-gon -- so-called minimal reflection surfaces. The minimal $n$-gon solves a free boundary problem in a fundamental piece of…
This dissertation is devoted to the resolution of the Plateau problem in the case of polygonal boundary curves in three-dimensional Euclidean space. It relies on the method developed by Ren\'e Garnier and published in 1928 in a paper which…