000			02911nam a22003618i 4500
001			CR9780511735172
003			UkCbUP
005			20200124160328.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			100325s2007||||enk o ||1 0|eng|d
020			_a9780511735172 (ebook)
020			_z9780521857574 (hardback)
020			_z9780521715225 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA491 _b.D46 2007
082	0	0	_a516/.156 _222
100	1		_aDemaine, Erik D., _d1981- _eauthor.
245	1	0	_aGeometric folding algorithms : _blinkages, origami, polyhedra / _cErik D. Demaine, Joseph O'Rourke.
264		1	_aCambridge : _bCambridge University Press, _c2007.
300			_a1 online resource (xiii, 472 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	0		_aIntroduction -- pt. 1. Linkages. Problem classification and examples -- Upper and lower bounds -- Planar linkage mechanisms -- Rigid frameworks -- Reconfiguration of chains -- Locked chains -- Interlocked chains -- Joint-constrained motion -- Protein folding -- pt. 2. Paper. Introduction -- Foundations -- Simple crease patterns -- General crease patterns -- Map folding -- Silhouettes and gift wrapping -- The tree method -- One complete straight cut -- Flattening polyhedra -- Geometric constructibility -- Rigid origami and curved creases -- pt. 3. Polyhedra. Introduction and overview -- Edge unfolding of polyhedra -- Reconstruction of polyhedra -- Shortest paths and geodesics -- Folding polygons to polyhedra -- Higher dimensions.
520			_aDid 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.
650		0	_aPolyhedra _xModels.
650		0	_aPolyhedra _xData processing.
700	1		_aO'Rourke, Joseph, _eauthor.
776	0	8	_iPrint version: _z9780521857574
856	4	0	_uhttps://doi.org/10.1017/CBO9780511735172
999			_c522354 _d522352