Related papers: Plane-filling curves on all uniform grids
Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$…
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is…
We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…
Working over imperfect fields, we give a comprehensive classification of genus-one curves that are regular but not geometrically regular, extending the known case of geometrically reduced curves. The description is given intrinsically, in…
We study collections of planar curves that yield diagrams for all knots. In particular, we show that a very special class called potholder curves carries all knots. This has implications for realizing all knots and links as special types of…
We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…
We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a)…
To investigate the topological structure of Morse flows on the 2-disk we use the planar graphs as destinguished graph of the flow. We assume, that the flow is transversal to the boundary of the 2-disk. We give a list of all planar graph…
There is a natural link between (multi-)curves that fill up a closed oriented surface and dessins d'enfants. We use this approach to exhibit explicitly the minima of the geodesic length function of a kind of curves (uniform filling curves)…
An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is an L-shape, and every edge is either…
In the past 20 years, compactifications of the families of curves in algebraic varieties X have been studied via stable maps, Hilbert schemes, stable pairs, unramified maps, and stable quotients. Each path leads to a different enumeration…
We study spaces of lines that meet a smooth hypersurface X in P^n to high order. As an application, we give a polynomial upper bound on the number of planes contained in a smooth degree d hypersurface in P^5 and provide a proof of a result…
This paper is concerned with the computation of an optimal matching between two manifold-valued curves. Curves are seen as elements of an infinite-dimensional manifold and compared using a Riemannian metric that is invariant under the…
This paper presents a methodology for finding numerically, by means of curve-following, all real solutions of a general system of $n$ nonlinear equations in $n$ unknowns, within a given $n$-dimensional box. The main idea behind our method…
We compute the topological monodromy of every family of complete intersection curves. Like in the case of plane curves previously treated by the second-named author, we find the answer is given by the $r$-spin mapping class group associated…
We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…
We prove that for every graph $G$, given fixed locations for the vertices of $G$ in $\mathbb{Z}^3$, there is a three-dimensional grid-drawing of $G$ with one bend per edge. The best previous bound was three bends per edge.
We study equi-singular strata of plane curves with two singular points of prescribed types. The method of the previous work [Kerner06] is generalized to this case. In particular we consider the enumerative problem for plane curves with two…
In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal ($45^\circ$) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few…