Improved bounds for intersecting triangles and halving planes

David Eppstein
J. Combinatorial Theory, Series A 62:176–182, 1993
Tech. report 91-60, Univ. of California, Irvine, Dept. of Information and Computer Science, 1991
Mathematical Reviews 94f:52006
http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-91-60.pdf

Cited by:

• Counting triangle crossings and halving planes
• Cutting dense point sets in half
• Results on $k$-sets and $j$-facets via continuous motion
• Arrangements and their applications
• Point sets with many $k$-sets
• Clustering for edge-cost minimization
• On levels in arrangements of curves
• Crossing-free segments and triangles in point configurations
• On levels in arrangements of surfaces in three dimensions