A hyperplane incidence problem with applications to counting distances
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Edelsbrunner, Herbert
Sharir, Micha
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. © Springer-Verlag Berlin Heidelberg 1990.
American Mathematical Society
1991
info:eu-repo/semantics/bookPart
doc-type:bookPart
text
http://purl.org/coar/resource_type/c_3248
https://research-explorer.ista.ac.at/record/3566
Edelsbrunner H, Sharir M. A hyperplane incidence problem with applications to counting distances. In: <i>Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift</i>. Vol 4. American Mathematical Society; 1991:253-263.
eng
info:eu-repo/semantics/altIdentifier/isbn/978-0897913850
info:eu-repo/semantics/closedAccess