Related papers: Untangling two systems of noncrossing curves

We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum…

We investigate constraints on embeddings of a non-orientable surface in a $4$-manifold with the homology of $M \times I$, where $M$ is a rational homology $3$-sphere. The constraints take the form of inequalities involving the genus and…

Many of the classic graph problems cannot be solved in the Massively Parallel Computation setting (MPC) with strongly sublinear space per machine and $o(\log n)$ rounds, unless the 1-vs-2 cycles conjecture is false. This is true even on…

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…

For a finite set $P$ of points in the plane in general position, a \emph{crossing family} of size $k$ in $P$ is a collection of $k$ line segments with endpoints in $P$ that are pairwise crossing. It is a long-standing open problem to…

A graph is \emph{fan-crossing free} if it has a drawing in the plane so that each edge is crossed by independent edges, that is the crossing edges have distinct vertices. On the other hand, it is \emph{fan-crossing} if the crossing edges…

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…

For Bezier curves, subdivision algorithms create control polygons as piecewise linear (PL) approximations that converge in terms of Hausdorff distance. We prove that the exterior angles of control polygons under subdivision converge to 0 at…

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$…

We show a somewhat surprising result: if $E$ is a disk in the plane $\mathbb R^2$, then there is a homeomorphism $h:\mathbb R^2\rightarrow\mathbb R^2$ such that, for every $x\in\partial E$, the orbit $O(x, h)$ is bounded, but for every…

Let $\Gamma$ be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve $\gamma \in \Gamma$, we denote the bounded region enclosed by $\gamma$ as $\tilde{\gamma}$. We say that $\Gamma$ is…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components with $g \geq 5$, $n \geq 0$. Let $\mathcal{T}(N)$ be the two-sided curve complex of $N$. If $\lambda :\mathcal{T}(N) \rightarrow…

Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their endpoints. A crossing in such a drawing is a point where two…

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…

While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…

The perturbation expansion for a general class of many-fermion systems with a non-nested, non-spherical Fermi surface is renormalized to all orders. In the limit as the infrared cutoff is removed, the counterterms converge to a finite limit…

Given any connected, open 3-manifold $U$ having finitely many ends, a non-compact 3-manifold $M$ is constructed having the following properties: the interior of $M$ is homeomorphic to $U$; the boundary of $M$ is the disjoint union of…

A longstanding avenue of research in orientable surface topology is to create and enumerate collections of curves in surfaces with certain intersection properties. We look for similar collections of curves in non-orientable surfaces. A…

Consider a planar, bounded, $m$-connected region $\Omega$, and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$ be a cellular decomposition of $\Omega\cup\bord\Omega$, where each 2-cell is either a triangle or a quadrilateral. From…