Almost tight bound for a single cell in an arrangement of convex polyhedra in R 3

DOI10.1145/1064092.1064099zbMATH Open1387.52022OpenAlexW2033506899MaRDI QIDQ5370592FDOQ5370592

Esther Ezra

Publication date: 20 October 2017

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

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55)

Cited In (3)

• The Union of Convex Polyhedra in Three Dimensions
• A Handlebody with One Pillbox has no Fake 3-Cells
• Almost tight upper bounds for the single cell and zone problems in the three dimensions

This page was built for publication: Almost tight bound for a single cell in an arrangement of convex polyhedra in R ³

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370592)