Hyperrhombs inscribed to convex bodies

DOI10.1016/0095-8956(78)90046-1zbMath0384.52007OpenAlexW2032075681MaRDI QIDQ1248961

David G. Larman, Hugo Hadwiger, P. Mani-Levitska

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90046-1

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Polytopes and polyhedra (52Bxx)

Related Items

On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Affine-inscribed and affine-circumscribed polygons and polytopes ⋮ Fulton-MacPherson compactification, cyclohedra, and the polygonal pegs problem ⋮ Computational complexity of norm-maximization

Cites Work

• On theorems of Borsuk-Ulam, Kakutani-Yamabe-Yujobô and Dyson. II
• A proof that there exists a circumscribing cube around any bounded closed convex set in \(\mathbb{R}^3\)
• Unnamed Item
• Unnamed Item
• Unnamed Item