Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-26T01:25:45.434Z Has data issue: false hasContentIssue false

Point–Line Incidences in Space

Published online by Cambridge University Press:  03 March 2004

MICHA SHARIR
Affiliation:
School of Computer Science, Tel Aviv University, Tel-Aviv 69978, Israel Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA (e-mail: [email protected])
EMO WELZL
Affiliation:
Institut für Theoretische Informatik, ETH Zürich, CH-8092 Zürich, Switzerland (e-mail: [email protected])

Abstract

Given a set $L$ of $n$ lines in ${\mathbb R}^3$, joints are points in ${\mathbb R}^3$ that are incident to at least three non-coplanar lines in $L$. We show that there are at most $O(n^{5/3})$ incidences between $L$ and the set of its joints.

This result leads to related questions about incidences between $L$ and a set $P$ of $m$ points in ${\mathbb R}^3$. First, we associate with every point $p \in P$ the minimum number of planes it takes to cover all lines incident to $p$. Then the sum of these numbers is at most \[ O\big(m^{4/7}n^{5/7}+m+n\big).\] Second, if each line forms a fixed given non-zero angle with the $xy$-plane – we say the lines are equally inclined – then the number of (real) incidences is at most \[ O\big(\min\big\{m^{3/4}n^{1/2}\kappa(m),\ m^{4/7}n^{5/7}\big\} + m + n\big) , \] where $\kappa(m) \,{=}\, (\log m)^{O(\alpha^2(m))}$, and $\alpha(m)$ is the slowly growing inverse Ackermann function. These bounds are smaller than the tight Szemerédi–Trotter bound for point–line incidences in $\reals^2$, unless both bounds are linear. They are the first results of this type on incidences between points and $1$-dimensional objects in $\reals^3$. This research was stimulated by a question raised by G. Elekes.

Type
Paper
Copyright
2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)