Sciweavers

2 search results - page 1 / 1
» Cutting triangular cycles of lines in space
Sort
View
65
Voted
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
15 years 10 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
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
14 years 11 months ago
Online point location in planar arrangements and its applications
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 ...
Sariel Har-Peled, Micha Sharir