Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances
Micha Sharir, Noam Solomon

TL;DR
This paper advances the understanding of incidences between points and algebraic curves or surfaces in three-dimensional space, providing new bounds and applications to classic problems like distances and similar triangles.
Contribution
It refines algebraic geometry tools to derive improved incidence bounds for points with curves and surfaces in 3D, generalizing previous results and applying them to distance problems.
Findings
New bounds for point-curve incidences in 3D
Enhanced bounds for point-surface incidences in 3D
Improved estimates for distances and similar triangles in 3D
Abstract
We study a wide spectrum of incidence problems involving points and curves or points and surfaces in . The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], 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 [Guth-Zahl 2016], by algebraic curves of some constant degree. By exploiting and refining these tools, we obtain new and improved bounds for numerous incidence problems in . In broad terms, we consider two kinds of problems, those involving points and constant-degree algebraic \emph{curves}, and those involving points and constant-degree algebraic \emph{surfaces}. In some variants we assume that the points lie on some fixed constant-degree algebraic…
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
TopicsPolynomial and algebraic computation · Computational Geometry and Mesh Generation · Advanced Numerical Analysis Techniques
