Realizability of Polyhedra
View/Open
Cita com:
hdl:2099/527
Document typeArticle
Defense date1979
PublisherUniversité du Québec à Montréal
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
We address ourselves to three types of combinatorial and projective problems, all of which
concern the patterns of faces, edges and vertices of polyhedra. These patterns, as combinatorial structures, we call combinatorial oriented polyhedra. Which patterns can be realized in space with plane faces, bent along every edge, and how can these patterns be generated topologlcally? Which polyhedra are constructed in space by a series of single or double truncations on the smallest polyhedron of the type (for example from the tetrahedron for spherical polyhedra)? Which plane line drawings portraying the edge graph of a combinatorial polyhedron are actually the projection of the edges of a plane-faced polyhedron in space? Wherever possible known results and specific conjectures are given.
CitationWhiteley, Walter. "Realizability of Polyhedra". Structural Topology, 1979, núm. 1
ISSN0226-9171
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
st1-07-a4.pdf | Article en anglès | 4,630Mb | View/Open |