 |
|
|
|
|
 |
|
|
Zonohedrification
|
|
|
|
|
|
| Organization: | Hofstra University |
| Department: | Department of Computer Science |
|
|
|
|
|
|
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
http://www.mathematica-journal.com/issue/v7i3/features/hart/
|
|
For the newest resources, visit Wolfram Repositories and Archives »
