Order Total (1 Item Items):
Shipping Destination:
Geometric Folding Algorithms Linkages by Demaine Erik (40 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (40)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
Binding
Collectible Attributes
- First Edition (7)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (13)
- Not Print on Demand (37)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
paperback. Condition: 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!
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Condition: 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.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Condition: 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.
-
paperback. Condition: Acceptable. Damaged spine, A readable copy. All pages are intact, and the cover is intact (the dust cover may be missing). Pages can include notes--in pen or highlighter.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Seller rating 5 out of 5 stars
£ 53.06
Convert currency£ 5.60 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: 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.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Condition: New.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Condition: New.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Condition: As New. Unread book in perfect condition.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Condition: New.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Paperback)
Published by Cambridge University Press, Cambridge, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
First Edition
Paperback. Condition: 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.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
hardcover. Condition: 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!
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press 2008-08-21, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
£ 56.21
Convert currency£ 15.49 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPaperback. Condition: New.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 61.22
Convert currency£ 11.98 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 58.69
Convert currency£ 15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
£ 74.11
Convert currency£ 7.52 shipping from Canada to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. Reprint. Special order direct from the distributor.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 66.84
Convert currency£ 15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom
Association Member: PBFA
Seller rating 5 out of 5 stars
£ 70
Convert currency£ 25 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCloth/Laminated Boards. Condition: Very Good. Type: Book N.B. Small plain label to inside front cover.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, Cambridge, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
First Edition
Hardcover. Condition: Near Fine. First Edition. First printing. 8vo. 472 pp. Near Fine. Slightest shelfwear to head of spine.
-
£ 88.77
Convert currency£ 10 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 1st edition. 496 pages. 10.00x7.00x1.00 inches. In Stock.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Paperback)
Published by Cambridge University Press, Cambridge, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
First Edition
£ 65.49
Convert currency£ 37 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Paperback)
Published by Cambridge University Press, Cambridge, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
First Edition
£ 102.26
Convert currency£ 27.84 shipping from Australia to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2008
ISBN 10: 0521715229 ISBN 13: 9780521715225
Language: English
£ 109
Convert currency£ 25 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
Condition: New.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 139.23
Convert currency£ 11.98 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 139.22
Convert currency£ 15 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
Condition: New.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
Condition: New.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Hardcover)
Published by Cambridge University Press, Cambridge, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
First Edition
£ 146.49
Convert currency£ 37 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: new. Hardcover. 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. How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results in this comprehensive look at the mathematics of 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Hardcover)
Published by Cambridge University Press, Cambridge, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Language: English
First Edition
Hardcover. Condition: new. Hardcover. 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. How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results in this comprehensive look at the mathematics of 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
