Counting and representing intersections among triangles in three dimensions

From MaRDI portal

Revision as of 00:23, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5361673

Jump to:navigation, search

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

arrangements 3SUM-hard problems counting intersections curve-sensitive cuttings triangles 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)

This page was built for publication: Counting and representing intersections among triangles in three dimensions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5361673&oldid=20069253"