English
Related papers

Related papers: Curves, points, incidences and covering

200 papers

We prove that a set $\mathcal X\subset \mathbb{C}^2,\ \#{\mathcal X}=mn,\ m\le n, $ is the set of intersection points of some two plane algebraic curves of degrees $m$ and $n,$ respectively, if and only if the following conditions are…

Algebraic Geometry · Mathematics 2019-04-09 Hakop Hakopian , Davit Voskanyan

If two Jordan curves in the plane have precisely one point in common, and there they do not properly cross, then the common point is called a {\em touching point}. The main result of this paper is a Crossing Lemma for simple curves: Let $X$…

Combinatorics · Mathematics 2017-08-08 János Pach , Natan Rubin , Gábor Tardos

We consider the following question: Given $n$ lines and $n$ circles in $\mathbb{R}^3$, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no…

Combinatorics · Mathematics 2020-05-29 Andrey Sergunin

We describe families of plane-filling curves on any edge-to-edge tiling of the plane with regular polygons and finitely many classes of edges. It is shown how to partition the minimal number of edge classes from the group G of symmetries of…

Combinatorics · Mathematics 2023-12-04 Jörg Arndt , Julia Handl

We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…

Geometric Topology · Mathematics 2008-02-22 Tahl Nowik

One of the big questions in the area of curves over finite fields concerns the distribution of the numbers of points: Which numbers occur as the number of points on a curve of genus $g$? The same question can be asked of various subclasses…

Algebraic Geometry · Mathematics 2010-12-02 Gary McGuire , Alexey Zaytsev

A surface embedded in space, in such a way that each point has a neighborhood within which the surface is a terrain, projects to an immersed surface in the plane, the boundary of which is a self-intersecting curve. Under what circumstances…

Computational Geometry · Computer Science 2008-06-11 David Eppstein , Elena Mumford

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

Geometric Topology · Mathematics 2012-08-21 Sergei Lanzat , Michael Polyak

We prove an incidence theorem for points and curves in the complex plane. Given a set of $m$ points in ${\mathbb R}^2$ and a set of $n$ curves with $k$ degrees of freedom, Pach and Sharir proved that the number of point-curve incidences is…

Combinatorics · Mathematics 2018-07-18 Adam Sheffer , Endre Szabó , Joshua Zahl

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

Combinatorics · Mathematics 2010-10-12 George B. Purdy , Justin W. Smith

Let $S$ be a set of $n$ points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of $S$ is less than $Kn^2$ for some $K=o(n^{\frac{1}{7}})$…

Metric Geometry · Mathematics 2017-06-22 Simeon Ball

A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any $n$ simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same…

Combinatorics · Mathematics 2014-12-23 János Pach , Natan Rubin , Gábor Tardos

We define a plane curve to be threadable if it can rigidly pass through a point-hole in a line L without otherwise touching L. Threadable curves are in a sense generalizations of monotone curves. We have two main results. The first is a…

Computational Geometry · Computer Science 2018-03-26 Joseph O'Rourke , Emmely Rogers

We study the structure of collections of algebraic curves in three dimensions that have many curve-curve incidences. In particular, let $k$ be a field and let $\mathcal{L}$ be a collection of $n$ space curves in $k^3$, with…

Algebraic Geometry · Mathematics 2024-02-27 Larry Guth , Joshua Zahl

In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…

Differential Geometry · Mathematics 2018-06-29 Stijn Cambie , Wendy Goemans , Iris Van den Bussche

We introduce an estimator for the curvature of curves and surfaces by using finite sample points drawn from sampling a probability distribution that has support on the curve or surface. First we give an algorithm for estimation of the…

Differential Geometry · Mathematics 2025-07-03 R. Mirzaie

We consider two incidence problems for integral curves of vector fields. The first is an analogue of the Euclidean joints problem, in which lines are replaced by integral curves of smooth vector fields taken from some finite-dimensional…

Classical Analysis and ODEs · Mathematics 2025-09-12 Kaiyi Huang , Betsy Stovall , Sarah Tammen

We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…

Combinatorics · Mathematics 2017-05-01 Micha Sharir , Noam Solomon

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

Algebraic Geometry · Mathematics 2019-11-07 Damian Rössler

Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…

Computational Geometry · Computer Science 2022-09-23 William Evans , Ellen Gethner , Jack Spalding-Jamieson , Alexander Wolff