Eppstein's bound on intersecting triangles revisited

DOI10.1016/j.jcta.2008.07.003zbMath1170.68042OpenAlexW2070611841MaRDI QIDQ1003657

Gabriel Nivasch, Micha Sharir

Publication date: 4 March 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2008.07.003

zbMATH Keywords

trianglesimplex\(k\)-setselection lemma

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Overlap properties of geometric expanders, Stabbing simplices by points and flats, Upper bounds for stabbing simplices by a line, Lower bounds for weak epsilon-nets and stair-convexity

Cites Work

• Unnamed Item
• Points and triangles in the plane and halving planes in space
• The colored Tverberg's problem and complexes of injective functions
• Improved bounds for intersecting triangles and halving planes
• Counting triangle crossings and halving planes
• On the number of halving planes
• Point Selections and Weak ε-Nets for Convex Hulls