Eliminating Depth Cycles among Triangles in Three Dimensions

DOI10.1137/1.9781611974782.164zbMath1410.68362OpenAlexW2485799025MaRDI 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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Combinatorial complexity of geometric structures (52C45)

Related Items (5)

Eliminating depth cycles among triangles in three dimensions ⋮ Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications ⋮ Removing depth-order cycles among triangles: an algorithm generating triangular fragments ⋮ Almost tight bounds for eliminating depth cycles in three dimensions ⋮ Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications

This page was built for publication: Eliminating Depth Cycles among Triangles in Three Dimensions