# 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

#### 31 Citations

Improved bounds for incidences between points and circles

- Computer Science, Mathematics
- SoCG '13
- 2013

On the number of tetrahedra with minimum, unit, and distinct volumes in three-space

- Mathematics, Computer Science
- SODA '07
- 2007

Incidences between Points and Circles in Three and
Higher Dimensions

- Computer Science, Mathematics
- Discret. Comput. Geom.
- 2005

Incidences with k-non-degenerate sets and their applications

- Mathematics, Computer Science
- J. Comput. Geom.
- 2014

Improved Bounds for Incidences Between Points and Circles

- Mathematics, Computer Science
- Combinatorics, Probability and Computing
- 2014

Distinct and repeated distances on a surface and incidences between points and spheres

- Mathematics
- 2016

Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances

- Computer Science, Mathematics
- SODA
- 2017

#### References

SHOWING 1-2 OF 2 REFERENCES

Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets

- Computer Science, Mathematics
- Discret. Comput. Geom.
- 1998