Bounds on the complexity of halfspace intersections when the bounded faces have small dimension

DOI10.1145/1998196.1998257zbMath1283.52033arXiv1103.2575OpenAlexW2151514046MaRDI QIDQ5404450

David Eppstein, Maarten Löffler

Publication date: 24 March 2014

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

Full work available at URL: https://arxiv.org/abs/1103.2575

zbMATH Keywords

combinatorial complexityconvex polyhedrahigh-dimensional geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

This page was built for publication: Bounds on the complexity of halfspace intersections when the bounded faces have small dimension