Related papers: A Crossing Lemma for Jordan Curves
We prove that the number of real intersection points of a real line with a real plane curve defined by a polynomial with at most t monomials is either infinite or does not exceed 6t -7. This improves a result by M. Avendano. Furthermore, we…
Simple drawings are drawings of graphs in the plane or on the sphere such that vertices are distinct points, edges are Jordan arcs connecting their endpoints, and edges intersect at most once (either in a proper crossing or in a shared…
We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pairwise cross at most $k$ times.
Several authors have recently attempted to show that the intersection of three simply connected subcontinua of the plane is simply connected provided it is non-empty and the intersection of each two of the continua is path connected. In…
Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In…
Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n^3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them.…
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…
Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$. We show that if $|R| < \frac{3}{2}n$ and $P…
We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…
We consider self-similar Jordan arcs $\gamma$ in $R^d$, different from a line segment and show that they cannot be projected to a line bijectively. Moreover, we show that the set of points $x\in\gamma$, for which there is a hyperplane,…
The matching problem for a given Jordan curve in the complex plane asks to find two nonconstant functions, one analytic in the bounded complementary component of the curve and the other analytic in the unbounded complementary component of…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…
The problem on the minimal number (with respect to deformation) of intersection points of two closed curves on a surface is solved. Following the Nielsen approach, we define classes of intersection points and essential classes of…
The maximum number of non-crossing straight-line perfect matchings that a set of $n$ points in the plane can have is known to be $O(10.0438^n)$ and $\Omega^*(3^n)$. The lower bound, due to Garc\'ia, Noy, and Tejel (2000) is attained by the…
We discuss a special case of a family of means defined using intersections of osculating hyperplanes to curves in R^n. Let C be the curve in R^n with vector equation x_{k}(t)=t(ln t)^{k-1},k=1,...,n. Let O_{k} be the osculating hyperplane…
Using a definition of Jordan curve similar to that of Dieudonn\'e, we prove that our notion is equivalent to that used by Berg et al. in their constructive proof of the Jordan Curve Theorem. We then establish a number of properties of…
We study the following question: given a set P of 3d-2 points and an immersed curve G in the real plane R^2, all in general position, how many real rational plane curves of degree d pass through these points and are tangent to this curve.…
We prove that for every smooth Jordan curve $\gamma$, if $X$ is the set of all $r \in [0,1]$ so that there is an inscribed rectangle in $\gamma$ of aspect ratio $\tan(r\cdot \pi/4)$, then the Lebesgue measure of $X$ is at least $1/3$. To do…
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…