Incidences with curves in three dimensions
Micha Sharir, Noam Solomon

TL;DR
This paper advances the understanding of point-curve incidences in three-dimensional space using algebraic geometry tools, providing new bounds and applications to geometric problems like counting specific triangles.
Contribution
It refines algebraic geometry techniques to establish improved bounds for point-curve incidences in 3D, generalizing previous results and applying them to geometric counting problems.
Findings
New bounds for point-curve incidences in R^3
Improved triangle counting bound of O(n^{15/7})
Generalization of previous incidence bounds to algebraic curves
Abstract
We study incidence problems involving points and curves in . The current (and in fact only viable) approach to such problems, pioneered by Guth and Katz, requires a variety of tools from algebraic geometry, most notably (i) the polynomial partitioning technique, and (ii) the study of algebraic surfaces that are ruled by lines or, in more recent studies, by algebraic curves of some constant degree. By exploiting and refining these tools, we obtain new and improved bounds for point-curve incidence problems in . Incidences of this kind have been considered in several previous studies, starting with Guth and Katz's work on points and lines. Our results, which are based on the work of Guth and Zahl concerning surfaces that are doubly ruled by curves, provide a grand generalization of most of the previous results. We reconstruct the bound for points and lines, and improve, in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Polynomial and algebraic computation · Algebraic Geometry and Number Theory
