Related papers: Incidences with curves in three dimensions
In this paper we consider adjoint restriction estimates for space curves with respect to general measures and obtain optimal estimates when the curves satisfy a finite type condition. The argument here is new in that it doesn't rely on the…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
Let $P$ be a set of $N$ points in the Euclidean plane, where a positive proportion of points lies off a single straight line. This note points out two facts concerning the number of equivalence classes of triangles that $P$ determines,…
The main purpose of this paper is to prove that the point-line incidence bound due to Vinh (2011) over arbitrary finite fields can be improved in certain ranges by using tools from the VC-dimension theory. As consequences, a number of…
Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…
Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the…
It is known that B\'{e}zier curves and surfaces may have multiple representations by different control polygons. The polygons may have different number of control points and may even be disjoint. Up to our knowledge, Pekerman et al. (2005)…
We consider real polynomial systems $f=g=0$ in two variables where $f$ has $t\geq 3$ monomial terms and $g$ has $3$ monomials terms. We prove that the number of positive isolated solutions of such a system does not exceed $3\cdot 2^{t-2} -…
This paper is concerned with finite element error estimates for Neumann boundary control problems posed on convex and polyhedral domains. Different discretization concepts are considered and for each optimal discretization error estimates…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
The estimation of surface integrals on the boundary of an unknown body is a challenge for nonparametric methods in statistics, with powerful applications to physics and image analysis, among other fields. Provided that one can determine…
We use methods from spectral graph theory to obtain bounds on the number of incidences between $k$-planes and $h$-planes in $\mathbb{F}_q^d$ which generalize a recent result given by Bennett, Iosevich, and Pakianathan (2014). More…
In the context of integrable partial difference equations on quad-graphs, we introduce the notion of open boundary reductions as a new means to construct discrete integrable mappings and their invariants. This represents an alternative to…
In the quadratic family (the set of polynomials of degree 2), Petersen and Zakeri proved the existence of Siegel disks whose boundaries are Jordan curves, but not quasicircles. In their examples, the critical point is contained in the…
Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…
In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
We consider elliptic curves defined by an equation of the form $y^2=x^3+f(t)$, where $f\in k[t]$ has coefficients in a perfect field $k$ of characteristic not $2$ or $3$. By performing $2$ and $3$-descent, we obtain, under suitable…
In this paper we give an upper bound on the number of rational points on an irreducible curve $C$ of degree $\delta$ defined over a finite field $\mathbb{F}_q$ lying on a Frobenius classical surface $S$ embedded in $\mathbb{P}^3$. This…