Characterizing Graphs of Zonohedra
| dc.creator | Adnan, Muhammad Abdullah | |
| dc.creator | Hasan, Masud | |
| dc.date | 2008-11-03 | |
| dc.date.accessioned | 2026-07-07T10:14:52Z | |
| dc.date.available | 2026-07-07T10:14:52Z | |
| dc.description | A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are parallelograms and are in parallel pairs. In this paper we give characterization of graphs of zonohedra. We also give a linear time algorithm to recognize such a graph. In our quest for finding the algorithm, we prove that in a zonohedron P both the number of zones and the number of faces in each zone is O(square root{n}), where n is the number of vertices of P. | |
| dc.description | 13 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/0811.0254 | |
| dc.identifier | http://arxiv.org/abs/0811.0254 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/173033 | |
| dc.subject | Computational Geometry | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Characterizing Graphs of Zonohedra | |
| dc.type | text |