---
res:
bibo_abstract:
- 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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Herbert
foaf_name: Edelsbrunner, Herbert
foaf_surname: Edelsbrunner
foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-9823-6833
- foaf_Person:
foaf_givenName: Micha
foaf_name: Sharir, Micha
foaf_surname: Sharir
bibo_volume: 4
dct_date: 1991^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/978-0897913850
dct_language: eng
dct_publisher: American Mathematical Society@
dct_title: A hyperplane incidence problem with applications to counting distances@
...