# Incidences between points and circles in three and higher dimensions

@inproceedings{Aronov2002IncidencesBP,
title={Incidences between points and circles in three and higher dimensions},
author={Boris Aronov and Vladlen Koltun and Micha Sharir},
booktitle={SCG '02},
year={2002}
}
• Published in SCG '02 5 June 2002
• Computer Science
(MATH) We show that the number of incidences between <i>m</i> distinct points and <i>n</i> distinct circles in $\reals^3$ is <i>O</i>(<i>m</i> <sup>4/7</sup> <i>n</i> <sup>17/21</sup>+<i>m</i> <sup>2/3</sup> <i>n</i> <sup>2/3</sup>+<i>m</i>+<i>n</i>); the bound is optimal for <i>m n</i> <sup>3/2</sup>. This result extends recent work on point-circle incidences in the plane, but its proof requires a different analysis. The bound improves upon a previous bound, noted by Akutsu et al.  and by…
Improved bounds for incidences between points and circles
• Computer Science
SoCG '13
• 2013
An improved upper bound is established for the number of incidences between m points and n arbitrary circles in three dimensions if the set of circles is required to be "truly three-dimensional" in the sense that no sphere or plane contains more than q of the circles.
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
• Computer Science
SODA '07
• 2007
An O(n<sup>3</sup>) time algorithm for reporting all tetrahedra of minimum nonzero volume, and thereby extend an early algorithm of Edelsbrunner, O'Rourke, and Seidel.
Distinct distances in three and higher dimensions
• Computer Science
STOC '03
• 2003
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set <i>P</i> of <i>n</i> points in three-dimensional space is
Incidences between Points and Circles in Three and Higher Dimensions
• Mathematics
Discret. Comput. Geom.
• 2005
The results improve the upper bound on the number of congruent copies of a fixed tetrahedron in a set of n points in 4-space and the lower bound for theNumber of distinct distances in aSet of n points in 3-space.
Incidences with k-non-degenerate sets and their applications
• Mathematics, Computer Science
J. Comput. Geom.
• 2014
It is proved that, for every $\varepsilon>0$, the number of incidences between a set of $m$ points and a $k$-non-degenerate set of £n\$ planes is O(m^{4/5+\varpsilon}n^{3/5}k^{2/5] + n + mk).
Incidence Problems in Plane and Higher Dimensions
This is a survey paper of recent results about the problem of counting number of incidences between points and curves in the plane. Also this discusses some results for this problem in higher
Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances
• Mathematics, Computer Science
SODA
• 2017
The results provide a "grand generalization" of most of the previous studies of (special instances of) previous works for both curves and surfaces and obtain new and improved bounds for two special cases.
Ramsey-type theorems for lines in 3-space
• Mathematics
Discret. Math. Theor. Comput. Sci.
• 2016
Geometric Ramsey-type statements on collections of lines in 3-space give guarantees on the size of a clique or an independent set in (hyper)graphs induced by incidence relations between lines, points, and reguli in3-space.
Incidences in Three Dimensions and Distinct Distances in the Plane†
• Mathematics
Combinatorics, Probability and Computing
• 2011
This work adapts the recent new algebraic analysis technique of Guth and Katz, as further developed by Elekes, Kaplan and Sharir, to obtain sharp bounds on the number of incidences between a certain class of helices or parabolas and points in ℝ3 and obtains the upper bound O(s3).
Non-Degenerate Spheres in Three Dimensions
• Mathematics
Combinatorics, Probability and Computing
• 2011
The previous bound given in  on the number of k-rich η-non-degenerate spheres in 3-space with respect to any set of n points in ℝ3 is improved.