Related papers: Compass Constructions
If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…
We review, from a didactic point of view, the definition of a toric section and the different shapes it can take. We'll then discuss some properties of this curve, investigate its analogies and differences with the most renowned conic…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
The early Renaissance artist Albrecht Durer published a book on geometry a few years before he died. This was intended to be a guide for young craftsmen and artists giving them both practical and mathematical tools for their trade. In the…
Motivated by applications requiring sparse or nonnegative controls, we investigate reachability properties of linear infinite-dimensional control problems under conic constraints. Relaxing the problem to convex constraints if the initial…
In this paper, we present a novel method to draw a circle tangent to three given circles lying on a plane. Using the analytic geometry and inversion (reflection) theorems, the center and radius of the inversion circle are obtained. Inside…
A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually…
The purpose of this paper is to introduce a version of singular homology based on smooth mappings of manifolds with corners. Although variants of such a theory exists in the literature, we felt that certain points were not adequately…
All parallel algorithms for directed reachability and shortest paths crucially rely on efficient shortcut constructions. These constructions find directed paths and shortcut them by adding edges, with the goal to reduce the diameter of the…
We introduce and study two Maker-Breaker-like games for constructing planar graphs: the edge drawing game, where two players take turns drawing non-intersecting edges between points in the plane, and the circle packing game, where the…
Let $A$ be a closed affine subspace and let $B$ be a hyperplane in a Hilbert space. Suppose we are given their associated nearest point mappings $P_A$ and $P_B$, respectively. We present a formula for the projection onto their intersection…
In this paper, we introduce the following new concept in graph drawing. Our task is to find a small collection of drawings such that they all together satisfy some property that is useful for graph visualization. We propose investigating a…
In this paper, we study how to find rational motions that move a line along a given rational ruled surface. Our goal is to find motions with the lowest possible degree using dual quaternions. While similar problems for point trajectories…
Squaring the circle is impossible, but it can be squared approximately. Ramanujan gave a construction correct to eight decimal places. In his book Mathographics, Dixon gave constructions correct to three decimal places. In this article, we…
Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the…
A construction is given for the recovery of a disjoint union of strictly convex smooth planar obstacles from travelling-time information. The obstacles are required to be such that no Euclidean line meets more than two of them.
A drawing of a graph in the plane is {\it pseudolinear} if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any pair of edges crosses precisely once. A special case are…
Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…
I provide methods of constructing elliptic and hyperelliptic curves over global fields with interesting rational points over the given fields or over large field extensions. I also provide a elliptic curves defined over any given number…
We propose a new method for inferring roads from GPS trajectories to map construction sites. This task presents a unique challenge due to the erratic and non-standard movement patterns of construction machinery, which significantly diverge…