Artículos relacionados a Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Sinopsis
Emphasizing algorithmic and computational aspects, this fascinating treatment of the geometry of folding and unfolding presents hundreds of results and over 60 open problems. Aimed at advanced undergraduates and graduates in mathematics or computer science, this lavishly illustrated book will entertain a broad audience, from school students to researchers.
"Sinopsis" puede pertenecer a otra edición de este libro.
Críticas
'Demaine and O'Rourke are among the best-qualified authors for a book on this subject; and the book that they have written is a delight ... it is exceptionally clear and readable. It could be read for pleasure by any mathematics undergraduate, and much of it (though not all) by amateurs with a high school mathematics background ... although there are sections that some amateurs will skip, the level is always kept as elementary as locally possible. This book should be in all university libraries, and many professional and amateur mathematicians will want to add it to their personal collections.' Robert Dawson (Halifax), Zentralblatt Math
'This book is one of those rare mathematics books that I had a hard time putting down. I wanted to keep reading to find the next insight. ... This is a serious mathematics book whose explorations have significant applications and real mathematical profundity, wonderfully mixed with some fun recreational mathematics. ... The book has a useful index and an extensive bibliography, so when you finish reading, it will remain a valuable resource far into the future. There is a lot of material in this book and it is really a lot of fun. I highly, highly recommend this book to anyone with even a passing interest in folding mathematics.' MAA Reviews
'The authors explain step-by-step interesting solutions of some folding problems. This splendidly illustrated book can be interesting for advanced undergraduate students in mathematics and computer science as well as for geometers and computer specialists who can find many new ideas and impulses ...' EMS Newsletter
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialCambridge University Press
- Año de publicación2008
- ISBN 10 0521715229
- ISBN 13 9780521715225
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas488
Comprar nuevo
Ver este artículo
EUR 69,64
EUR 3,52 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Imagen de archivo
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Publicado por
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Antiguo o usado
paperback
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
paperback. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Nº de ref. del artículo: S_425770350
Cantidad disponible: 1 disponibles
Imagen del vendedor
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Publicado por
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Antiguo o usado
Tapa blanda
Librería: Goodbooks Company, Springdale, AR, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: acceptable. This copy may contain significant wear, including bending, writing, tears, and or water damage. This book is a functional copy, not necessarily a beautiful copy. Copy may have loose or missing pages and may not include access codes or CD. Nº de ref. del artículo: GBV.0521715229.A
Cantidad disponible: 1 disponibles
Imagen del vendedor
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Publicado por
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Antiguo o usado
Tapa blanda
Librería: Goodbooks Company, Springdale, AR, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: good. Has a sturdy binding with some shelf wear. May have some markings or highlighting. Used copies may not include access codes or Cd's. Slight bending may be present. Nº de ref. del artículo: GBV.0521715229.G
Cantidad disponible: 1 disponibles
Imagen de archivo
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Publicado por
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Antiguo o usado
Paperback
Librería: WorldofBooks, Goring-By-Sea, WS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Nº de ref. del artículo: GOR014272454
Gastos de envío:
EUR 6,59
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Publicado por
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Nuevo
Tapa blanda
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190012888
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Publicado por
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Nuevo
Tapa blanda
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 5622204-n
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Publicado por
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Antiguo o usado
Tapa blanda
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 5622204
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Publicado por
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Nuevo
Tapa blanda
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9780521715225
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Paperback)
Publicado por
Cambridge University Press, Cambridge, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Nuevo
Paperback
Original o primera edición
Librería: Grand Eagle Retail, Fairfield, OH, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: new. Paperback. How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results and over 60 unsolved 'open problems' in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects. Folding and unfolding problems have been implicit since Albrecht Durer in the early 1500s, but have only recently been studied in the mathematical literature. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein folding. A proof shows that it is possible to design a series of jointed bars moving only in a flat plane that can sign a name or trace any other algebraic curve. One remarkable algorithm shows you can fold any straight-line drawing on paper so that the complete drawing can be cut out with one straight scissors cut. Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers. Emphasizing algorithmic and computational aspects, this fascinating treatment of the geometry of folding and unfolding presents hundreds of results and over 60 open problems. Aimed at advanced undergraduates and graduates in mathematics or computer science, this lavishly illustrated book will entertain a broad audience, from school students to researchers. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9780521715225
Cantidad disponible: 1 disponibles
Imagen de archivo
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Publicado por
Cambridge University Press 2008-08-21, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Nuevo
Paperback
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9780521715225
Gastos de envío:
EUR 18,24
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 10 disponibles