158 citations · 543 across the 80 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.CG2008
Line Transversals of Convex Polyhedra in
Haim Kaplan, Natan Rubin, Micha Sharir
We establish a bound of $O(n^2k^{1+\eps})$, for any $\eps>0$, on the combinatorial complexity of the set $\T$ of line transversals of a collection of convex polyhedra in $\…
cs.CG2008★ 12 cited
Eppstein's bound on intersecting triangles revisited
Gabriel Nivasch, Micha Sharir
Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Omega(m^3 / (n^6 log^2 n)) triang…