Publication:1745206: Difference between revisions
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Almost tight bounds for eliminating depth cycles in three dimensions to Almost tight bounds for eliminating depth cycles in three dimensions: Duplicate |
(No difference)
| |
Latest revision as of 14:57, 2 May 2024
DOI10.1007/s00454-017-9920-9zbMath1390.68703arXiv1512.00358MaRDI QIDQ1745206
Publication date: 20 April 2018
Published in: Discrete \& Computational Geometry, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.00358
computational geometry; polynomial partitioning; cycle elimination; lines in space; algebraic methods in combinatorial geometry; depth cycles; depth order; Painter's algorithm; polynomial partition; painter's algorithm
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
