Order Total (1 Item Items):
Shipping Destination:
9780521857574 - Geometric Folding Algorithms: Linkages, Origami, Polyhedra by Demaine, Erik D ; O'rourke, Joseph (21 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (21)
- 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 Learn more
- New (16)
- As New, Fine or Near Fine (4)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (21)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (4)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (7)
- Not Print on Demand (15)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
Seller Location
Seller Rating
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom
Association Member: PBFA
Seller rating 5 out of 5 stars
Cloth/Laminated Boards. Condition: Very Good. Type: Book N.B. Small plain label to inside front cover.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, Cambridge, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
First Edition
Hardcover. Condition: Near Fine. First Edition. First printing. 8vo. 472 pp. Near Fine. Slightest shelfwear to head of spine.
-
Geometric Folding Algorithms
Language: English
Published by Cambridge University Press CUP, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Condition: New. pp. 488.
-
Geometric Folding Algorithms
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Condition: New. pp. 488 Illus.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Hardcover. Condition: Like New. Like New. book.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Condition: As New. Unread book in perfect condition.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 166.26
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Condition: New.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 178.98
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 186.72
£ 15 shipping
Ships 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
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. Lavishly illustrated and entertaining account of the surprising and useful results of the maths of folding and unfolding. Num Pages: 488 pages, 330 colour illus. 16 tables. BIC Classification: PBM. Category: (U) Tertiary Education (US: College). Dimension: 186 x 259 x 31. Weight in Grams: 1084. . 2007. Illustrated. hardcover. . . . .
-
Hardcover. Condition: Brand New. 1st edition. 472 pages. 10.25x7.50x1.00 inches. In Stock.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Condition: New. Lavishly illustrated and entertaining account of the surprising and useful results of the maths of folding and unfolding. Num Pages: 488 pages, 330 colour illus. 16 tables. BIC Classification: PBM. Category: (U) Tertiary Education (US: College). Dimension: 186 x 259 x 31. Weight in Grams: 1084. . 2007. Illustrated. hardcover. . . . . Books ship from the US and Ireland.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Hardcover. Condition: new. New Copy. Customer Service Guaranteed.
-
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this comprehensive treatment of the geometry of folding and unfolding presents hundreds of results and over 60 unsolved 'open problems' to spur further research. The authors cover one-dimensional objects (linkages), 2D objects (paper), and 3D objects (polyhedra). 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.
-
Geometric Folding Algorithms (Hardcover)
Language: English
Published by Cambridge University Press, Cambridge, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
First Edition Print on Demand
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. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Hardcover. Condition: Brand New. 1st edition. 472 pages. 10.25x7.50x1.00 inches. In Stock. This item is printed on demand.
-
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Hardcover)
Language: English
Published by Cambridge University Press, Cambridge, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
First Edition Print on Demand
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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
Geometric Folding Algorithms
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 0521857570 ISBN 13: 9780521857574
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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,.
-
Geometric Folding Algorithms
Language: English
Published by Cambridge University Press, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
Condition: New. PRINT ON DEMAND pp. 488.
-
Geometric Folding Algorithms (Hardcover)
Language: English
Published by Cambridge University Press, Cambridge, 2007
ISBN 10: 0521857570 ISBN 13: 9780521857574
First Edition Print on Demand
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. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
