Geometric folding algorithms : linkages, origami, polyhedra /

Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s, but have only recently been studied in the mathematical literature. Emphasising algorithmic or computational aspects, this treatment of the geometry of folding and unfolding presents over 60 unsolved 'op...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Demaine, Erik D., 1981-
Otros Autores: O'Rourke, Joseph
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge ; New York : Cambridge University Press, 2007.
Temas:
Polyhedra > Models.
Polyhedra > Data processing.
Polyèdres > Modèles.
Polyèdres > Informatique.
MATHEMATICS > Geometry > General.
Polyhedra > Models
Polyeder
Algorithmische Geometrie
Geometri.
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Introduction
  • pt. 1. Linkages. Problem classification and examples
  • Upper and lower bounds
  • Planar linkage mechanisms
  • Rigid frameworks
  • Reconfiguration of chains
  • Locked chains
  • Interlocked chains
  • Joint-constrained motion
  • Protein folding
  • pt. 2. Paper. Introduction
  • Foundations
  • Simple crease patterns
  • General crease patterns
  • Map folding
  • Silhouettes and gift wrapping
  • The tree method
  • One complete straight cut
  • Flattening polyhedra
  • Geometric constructibility
  • Rigid origami and curved creases
  • pt. 3. Polyhedra. Introduction and overview
  • Edge unfolding of polyhedra
  • Reconstruction of polyhedra
  • Shortest paths and geodesics
  • Folding polygons to polyhedra
  • Higher dimensions.

Ejemplares similares