On the number of intersection points of lines and circles in $\mathbb R^3$
Andrey Sergunin

TL;DR
This paper investigates the maximum number of intersection points between lines and circles in three-dimensional space, establishing an upper bound under certain geometric constraints.
Contribution
It provides a new upper bound of O(n^{3/2}) for intersection points when no large subset of curves lies on a low-degree algebraic surface.
Findings
Maximum intersection points are O(n^{3/2}) under given conditions.
No large subset of curves on a low-degree surface implies this bound.
The result advances understanding of geometric incidences in 3D space.
Abstract
We consider the following question: Given lines and circles in , 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 curves (lines or circles) lying on an algebraic surface of degree at most two, then the number of these intersection points is .
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 · Point processes and geometric inequalities · Advanced Numerical Analysis Techniques
