Cliquer sur une vignette pour aller sur Google Books.
Chargement... Geometric Folding Algorithms: Linkages, Origami, Polyhedrapar Erik D. Demaine
Aucun Chargement...
Inscrivez-vous à LibraryThing pour découvrir si vous aimerez ce livre Actuellement, il n'y a pas de discussions au sujet de ce livre. Aucune critique aucune critique | ajouter une critique
Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers. Aucune description trouvée dans une bibliothèque |
Discussion en coursAucun
Google Books — Chargement... GenresClassification décimale de Melvil (CDD)516.156Natural sciences and mathematics Mathematics Geometry General Geometry Geometric shapes Other ShapesClassification de la Bibliothèque du CongrèsÉvaluationMoyenne:
Est-ce vous ?Devenez un(e) auteur LibraryThing. |