Artículos relacionados a Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca de los autores
Erik D. Demaine is the Esther and Harold E. Edgerton Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, where he joined the faculty in 2001. He is the recipient of several awards, including the MacArthur Fellowship, the Harold E. Edgerton Faculty Achievement Award, the Ruth and Joel Spira Award for Distinguished Teaching, and the NSERC Doctoral Prize. His research interests range throughout algorithms from data structures for improving web searches to the geometry of understanding how proteins relate to the computational difficulty of playing games. He has published more than 150 papers with more than 150 collaborators and coedited the book Tribute to a Mathemagician in honor of the influential recreational mathematician Martin Gardner.
Joseph O'Rourke is the Olin Professor of Computer Science at Smith College and the Chair of the Computer Science Department. He recently completed a one-year appointment as Interim Director of Engineering. He has received several grants and awards, including a Presidential Young Investigator Award, a Guggenheim Fellowship, and the NSF Director's Award for Distinguished Teaching Scholars. His research is in the field of computational geometry, where he has published a monograph and a textbook, and he coedited the 1500-page Handbook of Discrete and Computational Geometry. Thirty-one of his more than one hundred papers published in journals and conference proceedings are coauthored with undergraduates.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 68,21
EUR 3,45 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 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, heavy writing, tears, and or water damage. This book is a functional copy, not necessarily a beautiful copy. Copy may have loose pages. May not include access codes or CDs. May be an Ex library book with stickers and stamps. Dustjacket may be missing. 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
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 (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, Mason, 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
ISBN 10: 0521715229
ISBN 13: 9780521715225
Nuevo
Tapa blanda
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9780521715225_new
Gastos de envío:
EUR 13,76
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Impresión bajo demandaLibrería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 1st edition. 496 pages. 10.00x7.00x1.00 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __0521715229
Gastos de envío:
EUR 11,49
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-08-21, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Nuevo
Paperback
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9780521715225
Gastos de envío:
EUR 17,79
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 10 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: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 5622204-n
Gastos de envío:
EUR 17,23
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles