Incidences between points and circles in three and higher dimensions

@inproceedings{Aronov2002IncidencesBP,
  title={Incidences between points and circles in three and higher dimensions},
  author={B. Aronov and V. Koltun and M. Sharir},
  booktitle={SCG '02},
  year={2002}
}
(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. [2] and by… Expand
30 Citations

Figures and Topics from this paper

Improved bounds for incidences between points and circles
Distinct distances in three and higher dimensions
Similar simplices in a d-dimensional point set
Incidences between Points and Circles in Three and Higher Dimensions
Incidences with k-non-degenerate sets and their applications
Improved Bounds for Incidences Between Points and Circles
Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances
...
1
2
3
...

References

SHOWING 1-2 OF 2 REFERENCES
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets