Finding optimal shadows of polytopes

DOI10.1007/s004540010029zbMath0956.68145OpenAlexW2095426599MaRDI QIDQ1580746

Peter Gritzmann, Thomas Burger

Publication date: 14 September 2000

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004540010029

zbMATH Keywords

computational complexitypolynomial-time approximation algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polytopes and polyhedra (52B99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

COMPUTING NICE PROJECTIONS OF CONVEX POLYHEDRA ⋮ Equiprojective polyhedra ⋮ On the reverse Loomis-Whitney inequality ⋮ Computing Nice Projections of Convex Polyhedra ⋮ On the co-NP-completeness of the zonotope containment problem ⋮ Minimal-volume projections of cubes and totally unimodular matrices

This page was built for publication: Finding optimal shadows of polytopes