Counting and representing intersections among triangles in three dimensions

DOI10.1145/997817.997851zbMath1377.68273OpenAlexW2034829438MaRDI QIDQ5361673

Esther Ezra, Micha Sharir

Publication date: 29 September 2017

Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/997817.997851

zbMATH Keywords

arrangements3SUM-hard problemscounting intersectionscurve-sensitive cuttingstriangles in three dimensions

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)