Related papers: The Geometry of Putting on a Planar Surface
What is the best representation for doing euclidean geometry on computers? These notes from a SIGGRAPH 2019 short course entitled "Geometric algebra for computer graphics" introduce projective geometric algebra (PGA) as a modern framework…
A distance-squared function is one of the most significant functions in the application of singularity theory to differential geometry. Moreover, distance-squared mappings are naturally extended mappings of distance-squared functions,…
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any…
Consider the projection of a smooth irreducible surface in $\mathbb{P}^3$ from a point. The uniform position principle implies that the monodromy group of such a projection from a general point in $\mathbb{P}^3$ is the whole symmetric…
In \emph{smooth orthogonal layouts} of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this paper, we study the problem of finding smooth orthogonal…
Rotary pleating is a widely used process for making filters out of nonwoven fabric sheets. This involves indirect elastic-plastic bending of pre-weakened creases by continuously injecting material into an accordion-shaped pack. This step…
The equidistant set of two nonempty subsets $K$ and $L$ in the Euclidean plane is a set all of whose points have the same distance from $K$ and $L$. Since the classical conics can be also given in this way, equidistant sets can be…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
The `linear orbit' of a plane curve of degree d is its orbit in P^{d(d+3)/2} under the natural action of PGL(3). We classify curves with positive dimensional stabilizer, and we compute the degree of the closure of the linear orbits of…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
A translation surface is given by polygons in the plane, with sides identified by translations to create a closed Riemann surface with a flat structure away from finitely many singular points. Understanding geodesic flow on a surface…
A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n -…
Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex of the path. It is known that, if S is sufficiently large,…
In this paper, we introduce some known map projections from a model of the Earth to a flat sheet of paper or map and derive the plotting equations for these projections. The first fundamental form and the Gaussian fundamental quantities are…
A detailed set of experiments are described that capture over a 1000 different instances of the bounce of a golf ball. Video analysis is used to capture velocity and spin immediately prior to and subsequent to each bounce for a wide variety…
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…
The present paper deals with a study of curves on a smooth surface whose position vector always lies in the tangent plane of the surface and it is proved that such curves remain invariant under isometry of surfaces. It is also shown that…
We study the Dirichlet problem associated to the equation for self-similar surfaces for graphs over the Euclidean plane with a disk removed. We show the existence of a solution provided the boundary conditions on the boundary circle are…
We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…
Consider a sequence of closed, orientable surfaces of fixed genus $g$ in a Riemannian manifold $M$ with uniform upper bounds on mean curvature and area. We show that on passing to a subsequence and choosing appropriate parametrisations, the…