Related papers: Stabbing Faces By a Convex Curve

Let $G$ be a graph embedded in a surface and let $\mathcal F$ be a set of even faces of $G$ (faces bounded by a cycle of even length). The resonance graph of $G$ with respect to $\mathcal F$, denoted by $R(G;\mathcal F)$, is a graph such…

Given a planar straight-line graph $G=(V,E)$ in $\mathbb{R}^2$, a \emph{circumscribing polygon} of $G$ is a simple polygon $P$ whose vertex set is $V$, and every edge in $E$ is either an edge or an internal diagonal of $P$. A circumscribing…

We show that every outerplanar graph $G$ can be linearly embedded in the plane such that the number of distinct distances between pairs of adjacent vertices is at most thirteen and there is no intersection between the image of a vertex and…

It is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in the plane, where the edges are polylines with two bends per edge and any pair of edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq 3$.…

We show that on any Riemannian surface for each $0<c<\infty$ there exists an immersed $C^{1,1}$ curve that is smooth and with curvature equal to $\pm c$ away from a point. We give examples showing that, in general, the regularity of the…

Visualizing a graph $G$ in the plane nicely, for example, without crossings, is unfortunately not always possible. To address this problem, Masa\v{r}\'ik and Hlin\v{e}n\'y [GD 2023] recently asked for each edge of $G$ to be drawn without…

Given an $n$-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) between the two drawings that preserves…

In this work, we introduce and develop a theory of convex drawings of the complete graph $K_n$ in the sphere. A drawing $D$ of $K_n$ is convex if, for every 3-cycle $T$ of $K_n$, there is a closed disc $\Delta_T$ bounded by $D[T]$ such…

We study cubic rational maps that take lines to plane curves. A complete description of such cubic rational maps concludes the classification of all planarizations, i.e., maps taking lines to plane curves.

Suppose that $A$ is a convex body in the plane and that $A_1,\dots,A_n$ are translates of $A$. Such translates give rise to an intersection graph of $A$, $G=(V,E)$, with vertices $V=\{1,\dots,n\}$ and edges $E=\{uv\mid A_u\cap A_v\neq…

A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints. It is plane if it contains no crossing edges. We study…

The conchoid of a plane curve $C$ is constructed using a fixed circle $B$ in the affine plane. We generalize the classical definition so that we obtain a conchoid from any pair of curves $B$ and $C$ in the projective plane. We present two…

A telegraphic survey of some of the standard results and conjectures about the set $C({\bf Q})$ of rational points on a smooth projective absolutely connected curve $C$ over ${\bf Q}$.

We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…

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…

In this paper we begin to study curves on a weighted projective plane with one trivial weight, ${\mathbb P}(1,m,n)$, by determining the genus of curves of Fermat type. These are curves defined by a ``homogeneous'' polynomial analagous to…

We look at generalized Delaunay graphs in the constrained setting by introducing line segments which the edges of the graph are not allowed to cross. Given an arbitrary convex shape $C$, a constrained Delaunay graph is constructed by adding…

We prove that, given two topologically-equivalent upward planar straight-line drawings of an $n$-vertex directed graph $G$, there always exists a morph between them such that all the intermediate drawings of the morph are upward planar and…

We prove that if $C$ is a reflexive smooth plane curve of degree $d$ defined over a finite field $\mathbb{F}_q$ with $d\leq q+1$, then there is an $\mathbb{F}_q$-line $L$ that intersects $C$ transversely. We also prove the same result for…

A drawing of a graph is 1-planar if each edge participates in at most one crossing and adjacent edges do not cross. Up to symmetry, each crossing in a 1-planar drawing belongs to one out of six possible crossing types, where a type…