Eliminating Depth Cycles among Triangles in Three Dimensions
From MaRDI portal
Publication:4575913
DOI10.1137/1.9781611974782.164zbMath1410.68362MaRDI QIDQ4575913
Edward Y. Miller, Micha Sharir, Boris Aronov
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974782.164
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52C35: Arrangements of points, flats, hyperplanes (aspects of discrete geometry)
14Q20: Effectivity, complexity and computational aspects of algebraic geometry
52C45: Combinatorial complexity of geometric structures
Related Items
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications, Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications, Almost tight bounds for eliminating depth cycles in three dimensions, Eliminating depth cycles among triangles in three dimensions, Removing depth-order cycles among triangles: an algorithm generating triangular fragments