论文信息 - Convex Polyhedra Realizing Given Face Areas

Convex Polyhedra Realizing Given Face Areas

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

[1] J. O´Rourke,et al. Computational Geometry in C: Arrangements , 1998 .

[2] Alessia Mandini. A Note on the Moduli Space of Polygons , 2008 .

[3] Sue Whitesides,et al. Reconfiguring closed polygonal chains in Euclideand-space , 1995, Discret. Comput. Geom..

[4] D. Chand,et al. On Convex Polyhedra , 1970 .

[5] G. C. Shephard,et al. Convex Polytopes , 1969, The Mathematical Gazette.

[6] Erik D. Demaine,et al. Geometric folding algorithms - linkages, origami, polyhedra , 2007 .

[7] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .

[8] J. O'Rourke,et al. Geometric Folding Algorithms: Linkages , 2007 .

[9] John E. Hopcroft,et al. Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..

[10] James J. Little,et al. Extended Gaussian images, mixed volumes, shape reconstruction , 1985, SCG '85.