Related papers: Plane-filling curves on all uniform grids

We describe families of plane-filling curves on any edge-to-edge tiling of the plane with regular polygons and finitely many classes of edges. It is shown how to partition the minimal number of edge classes from the group G of symmetries of…

Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…

A plane curve $C$ in $\mathbb{P}^2$ defined over $\mathbb{F}_q$ is called plane-filling if $C$ contains every $\mathbb{F}_q$-point of $\mathbb{P}^2$. Homma and Kim, building on the work of Tallini, proved that the minimum degree of a smooth…

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

The order in which plane-filling curves visit points in the plane can be exploited to design efficient algorithms. Typically, the curves are useful because they preserve locality: points that are close to each other along the curve tend to…

For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding…

For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…

A self-avoiding plane-filling curve cannot be periodic, but we show that it can satisfy the local isomorphism property. We investigate three families of coverings of the plane by finite sets of nonoverlapping self-avoiding curves which…

Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…

This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is…

We study plane curves over finite fields whose tangent lines at smooth $\mathbb{F}_q$-points together cover all the points of $\mathbb{P}^2(\mathbb{F}_q)$.

We consider the motion by curvature of a network of smooth curves with multiple junctions in the plane, that is, the geometric gradient flow associated to the length functional. Such a flow represents the evolution of a two--dimensional…

The author determines the structure of automorphism groups of smooth plane curves of degree at least four. Furthermore, he gives some upper bounds for the order of automorphism groups of smooth plane curves and classifies the cases with…

We consider the curves whose all normal planes are at the same distance from a fixed point and obtain some characterizations of them in the 3-dimensional Euclidean space.

We study the lengths of curves passing through a fixed number of points on the boundary of a convex shape in the plane. We show that for any convex shape $K$, there exist four points on the boundary of $K$ such that the length of any curve…

These results complete our paper in Hiroshima Mathematical Journal, vol. 42, pp. 37-75. Let C be a covering of the plane by disjoint complete folding curves which satisfies the local isomorphism property. We show that C is locally…

We give a criterion when a planar tree-like curve, i.e. a generic immersed plane curve each double point of which cuts it into two disjoint parts, can be send by a diffeomorphism of the plane onto a curve with no inflection points. We also…

Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…

A \emph{$k$-track} layout of a graph consists of a vertex $k$ colouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. A \emph{$k$-queue} layout of a graph consists of a…

We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…