Convex Polyhedra Realizing Given Face Areas

14 years 10 months ago

Download maven.smith.edu

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.

Joseph O'Rourke

Real-time Traffic

Convex Polyhedron | CORR 2011 | Education | Face Areas | Positive Real Numbers |

claim paper

» Polyhedron realization for shape transformation

» On the Fewest Nets Problem for Convex Polyhedra

» Volume Queries in Polyhedra

» A RealTime Algorithm for Accurate Collision Detection for Deformable Polyhedral Objects

» Glasses Detection and Extraction by Deformable Contour

» Solving a RealWorld Train Unit Assignment Problem

» The sensor selection problem for bounded uncertainty sensing models

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Joseph O'Rourke

Comments (0)

Sciweavers

Convex Polyhedra Realizing Given Face Areas

Convex Polyhedron | CORR 2011 | Education | Face Areas | Positive Real Numbers |

Explore & Download

Productivity Tools

Sciweavers