Skip to main content
Log in

A Theory of Nets for Polyhedra and Polytopes Related to Incidence Geometries

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Our purpose is to elaborate a theory of planar nets or unfoldings for polyhedra, its generalization and extension to polytopes and to combinatorial polytopes, in terms of morphisms of geometries and the adjacency graph of facets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. D. Alexandrow, Die innere Geometrie der konvexen Fläche, Akademie Verlag, Berlin (1955).

    Google Scholar 

  2. A. D. Alexandrow, Konvexe Polyeder, Akademie-Verlag, Berlin (1958).

    Google Scholar 

  3. T. F. Banchoff, Beyond the Third Dimension, Scientific American Library, New York (1990).

    Google Scholar 

  4. S. Bouzette and F. Vandamme, The Regular Dodecahedron and Icosahedron Unfold in 43380 Ways, Travaux de Mathématique. Fascicule II, Université Libre de Bruxelles (1993).

  5. S. Bouzette, Duality and nets of polyhedra homeomorphic to a sphere, Unpublished (1993).

  6. F. Buekenhout, Diagrams for Geometries and Groups, J. Comb. Th. (A), Vol. 27 (1979) pp. 121–151.

    Google Scholar 

  7. F. Buekenhout, Questions about Linear Spaces, Discrete Math., Vol. 129 (1994) pp. 19–27.

    Google Scholar 

  8. F. Buekenhout, editor Handbook of Incidence Geometry, Buildings and Foundations, North Holland, Amsterdam (1995).

    Google Scholar 

  9. F. Buekenhout and M. Parker, The number of nets of the regular convex polytopes. Preprint (1995).

  10. L. Danzer and E. Schulte, Reguläre Inzidenzkomplexe I, Geom. Ded., Vol. 13 (1982) pp. 295–308.

    Google Scholar 

  11. F. Harary, Graph Theory, Addison-Wesley (1969).

  12. C. Hippenmeyer, Die Anzahl der inkongruenten ebenen Netze eines regulären Ikosaeders, Elem. Math., Vol. 34 (1979) pp. 61–63.

    Google Scholar 

  13. M. Jeger, Über die Anzahl der inkongruenten ebenen Netze des Würfels und des regulären Oktaeders, Elemente der Math., Vol. 30 (1975) pp. 73–82.

    Google Scholar 

  14. P. McMullen, Realizations of regular polytopes, Aequationes Math., Vol. 37 (1989) pp. 38–56.

    Google Scholar 

  15. P. McMullen and E. Schulte, Abstract regular polytopes. Monograph. In preparation (1996).

  16. H. Reggini, Regular polyhedra: random generation, hamiltonian paths and single chain nets, Monografias Acad. Nac. Cien. Exac., Fys. y Nat. No6 (1991).

  17. G. C. Shephard, Convex polytopes with convex nets, Math. Proc. Camb. Philo. Soc., Vol. 78 (1975) pp. 389–403.

    Google Scholar 

  18. P. Tougne, Combien de patrons un polyèdre peut-il avoir?, Pour la Science, Vol. 5,No. 86 (1986) pp. 99–103.

    Google Scholar 

  19. G. Valette, Private Communication (1993).

  20. M. J. Wenninger, Dual Models, Cambridge Univ. Press (1983).

  21. M. J. Wenninger, Polyhedron Models, Cambridge Univ. Press (1971).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bouzette, S., Buekenhout, F., Dony, E. et al. A Theory of Nets for Polyhedra and Polytopes Related to Incidence Geometries. Designs, Codes and Cryptography 10, 115–136 (1997). https://doi.org/10.1023/A:1008284101986

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008284101986

Navigation