Algorithms pp 419-428
A hyperplane Incidence problem with applications to counting distances
- Cite this paper as:
- Edelsbrunner H., Sharir M. (1990) A hyperplane Incidence problem with applications to counting distances. In: Asano T., Ibaraki T., Imai H., Nishizeki T. (eds) Algorithms. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg
This paper proves an O(m2/3n2/3+m+n) upper bound on the number of incidences between m points and n hyperplanes in four dimensions, assuming all points lie on one side of each hyperplane and the points and hyperplanes satisfy certain natural general position conditions. This result has application to various three-dimensional combinatorial distance problems. For example, it implies the same upper bound for the number of bichromatic minimum distance pairs in a set of m blue and n red points in three-dimensional space. This improves the best previous bound for this problem.
Unable to display preview. Download preview PDF.