Sciweavers

STOC
2003
ACM
140views Algorithms» more  STOC 2003»
14 years 5 months ago
Cutting triangular cycles of lines in space
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
Boris Aronov, Vladlen Koltun, Micha Sharir