Related papers: Untangling Planar Curves
Hopf's Umlaufsatz relates the total curvature of a closed immersed plane curve to its rotation number. While the curvature of a curve changes under local deformations, its integral over a closed curve is invariant under regular homotopies.…
In this paper, for $1<p<\infty$, we obtain the $L^p$-boundedness of the Hilbert transform $H^{\gamma}$ along a variable plane curve $(t,u(x_1, x_2)\gamma(t))$, where $u$ is a Lipschitz function with small Lipschitz norm, and $\gamma$ is a…
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…
A multigraph drawn in the plane is non-homotopic if no two edges connecting the same pair of vertices can be continuously deformed into each other without passing through a vertex, and is $k$-crossing if every pair of edges…
Given a smooth curve defined over a field $k$ that admits a non-singular plane model over $\overline{k}$, a fixed separable closure of $k$, it does not necessarily have a non-singular plane model defined over the field $k$. We determine…
A bounded curvature path is a continuously differentiable piecewise $C^2$ path with a bounded absolute curvature that connects two points in the tangent bundle of a surface. In this work, we analyze the homotopy classes of bounded curvature…
The Planar Graph Metric Compression Problem is to compactly encode the distances among $k$ nodes in a planar graph of size $n$. Two na\"ive solutions are to store the graph using $O(n)$ bits, or to explicitly store the distance matrix with…
A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…
We present simpler algorithms for two closely related morphing problems, both based on the barycentric interpolation paradigm introduced by Floater and Gotsman, which is in turn based on Floater's asymmetric extension of Tutte's classical…
We explain how, given a plane algebraic curve $\mathcal{C}\colon f(x,y) = 0$, $x_1 \in \mathbb{C}$ not a singularity of $y$ w.r.t. $x$, and $\varepsilon > 0$, we can compute $\delta > 0$ such that $|y_j(x_1) - y_j(x_2)| < \varepsilon$ for…
We study the local equivalence problems of curves and surfaces in three dimensional Heisenberg group via Cartans method of moving frames and Lie groups, and find a complete set of invariants for curves and surfaces. For surfaces, in terms…
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 present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…
We prove that every topological conjugation between two germs of singular holomorphic curves in the complex plane is homotopic to another conjugation which extends homeomorphically to the exceptional divisors of their minimal…
Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\lambda$ be a simplicial map of the complex of curves, $\mathcal{C}(N)$, on $N$ which satisfies the following: $[a]$ and $[b]$ are…
We study the existence of area-minimizing homotopies between homotopic curves in the plane. While the classical Plateau problem establishes the existence of least-area surfaces spanning a single Jordan curve, the corresponding existence…
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph…
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…