2 search results - page 1 / 1 » Cutting triangular cycles of lines in space |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
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...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...