We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
In this short note, we revisit the so-called Ermakov–Pinney (EP) equation viewing its properties from a physically motivated perspective. We discuss its ties with the Schr¨odin...
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...