Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions-Reference-Cited by-同舟云学术

Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions

Published:2017-09-06 Issue:3 Volume:59 Page:725-741
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Aronov Boris^ORCID,Sharir Micha

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00454-017-9920-9/fulltext.html

Reference23 articles.

1. Algorithms and Combinatorics;PK Agarwal,2003

2. Agarwal, P.K., Matoušek, J., Sharir, M.: On range searching with semialgebraic sets. II. SIAM J. Comput. 42(6), 2039–2062 (2013). arXiv:1208.3384

3. Aronov, B., de Berg, M., Gray, C., Mumford, E.: Cutting cycles of rods in space: hardness results and approximation algorithms. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’08), pp. 1241–1248. SIAM, Philadelphia (2008)

4. Aronov, B., Koltun, V., Sharir, M.: Cutting triangular cycles of lines in space. Discrete Comput. Geom. 33(2), 231–247 (2005)

5. Aronov, B., Miller, E.Y., Sharir, M.: Eliminating depth cycles among triangles in three dimensions. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’17), pp. 2476–2494. SIAM, Philadelphia (2017). arXiv:1607.06136

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Counting and Cutting Rich Lenses in Arrangements of Circles;SIAM Journal on Discrete Mathematics;2022-04-11

2. Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications;SIAM Journal on Computing;2021-01

3. Eliminating Depth Cycles Among Triangles in Three Dimensions;Discrete & Computational Geometry;2020-07-14

4. Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications;SIAM Journal on Computing;2020-01

5. Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments;Discrete & Computational Geometry;2019-05-23