Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings


George W. Hart
Organization: Hofstra University
Department: Department of Computer Science
URL: http://www.georgehart.com/
Journal / Anthology

The Mathematica Journal
Year: 1999
Volume: 7
Issue: 3
Page range: 374-389

Background; Data Structures; Procedures; Examples; Conclusions

An efficient algorithm is presented to "zonohedrify" a given polyhedron. There are relatively few interesting processes which input an arbitrary polyhedron and output a related polyhedron. Well-known examples are truncation, stellation, dualization (reciprocation in a sphere), and compounding. To this list can be added zonohedrification, in which the vertex directions of the original polyhedron (relative to an arbitrary center) determine the edge directions of the resulting zonohedrification. A few mathematical properties of zonohedra are outlined to give the reader insight into zonohedral structure and an understanding of the algorithm.

*Mathematics > Geometry > Solid Geometry
Related items

*Elect, Bead, and Star Zonohedra   [in MathSource: Packages and Programs]
*Graphics Gallery: Polar Zonohedra   [in Articles]
*Zonohedra and Zonotopes   [in Articles]
*Zonohedral Completion   [in MathSource: Packages and Programs]


Translate this page: