Almost tight bounds for eliminating depth cycles in three dimensions

@inproceedings{Aronov2016AlmostTB,
  title={Almost tight bounds for eliminating depth cycles in three dimensions},
  author={Boris Aronov and Micha Sharir},
  booktitle={STOC},
  year={2016}
}
Given n non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into O(n3/2polylog n) pieces, such that the depth relation among these pieces is now a proper partial order. This bound is nearly tight in the worst case. As a consequence, we deduce that the number of pairwise non-overlapping cycles, namely, cycles whose xy-projections do not overlap, is O(n3/2polylog n); this bound too is almost tight in the worst case… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Polynomial partitioning for a set of varieties

L. Guth
Math. Proc. Cambridge Phil. Soc. 159 • 2015
View 4 Excerpts
Highly Influenced

On the ratio of optimal integral and fractional covers

Discrete Mathematics • 1975
View 6 Excerpts
Highly Influenced

Cutting Cylces of Rods in Space

Symposium on Computational Geometry • 1998
View 8 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…