Convex Polyhedra Realizing Given Face Areas

2011/01/04 by Joseph O’Rourke, O'Rourke, Joseph
Computer Science · Engineering · #Computational Geometry and Mesh Generation #Control and Dynamics of Mobile Robots #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #Robotic Path Planning Algorithms

paper · pdf · doi:10.48550/arxiv.1101.0823

openalex publication_date 2011/01/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

Given n >= 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.

Related

• An algorithm to reconstruct convex polyhedra from their face normals and areas
• A Set of Questions in Combinatorial and Metric Geometry
• On some characterizations of convex polyhedra
• Basic Polyhedral Theory
• Compact hyperbolic tetrahedra with non-obtuse dihedral angles