Computer Science – Computational Geometry
Scientific paper
2009-06-02
Computer Science
Computational Geometry
Scientific paper
Let $L$ be a set of $n$ lines in $\reals^d$, for $d\ge 3$. A {\em joint} of $L$ is a point incident to at least $d$ lines of $L$, not all in a common hyperplane. Using a very simple algebraic proof technique, we show that the maximum possible number of joints of $L$ is $\Theta(n^{d/(d-1)})$. For $d=3$, this is a considerable simplification of the orignal algebraic proof of Guth and Katz~\cite{GK}, and of the follow-up simpler proof of Elekes et al. \cite{EKS}.
Kaplan Haim
Sharir Micha
Shustin Eugenii
No associations
LandOfFree
On lines and Joints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On lines and Joints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On lines and Joints will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-235750