000			02058cam a2200277 a 4500
001			0000023757
005			20230921135937.0
008			061115s2007 enkm b a001 0 eng
010			_a2006038156
020			_a9780521857574 : _c$68.00
050	0	0	_aQA491 _b.D46 2007
100	1		_aDemaine, Erik D., _d1981-.
245	1	0	_aGeometric folding algorithms : _blinkages, origami, polyhedra / _cby Erik D. Demaine and Joseph O'Rourke.
260			_aCambridge ; _aNew York : _bCambridge University Press, _c2007.
264			_aCambridge ; _bCambridge University Press, _c2007
300			_axiii, 472 pages : _billustrations (some color) ; _c26 cm.
504			_aIncludes bibliographical references (p. 443-461) and index.
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			_aFolding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s, but have only recently been studied in the mathematical literature. Emphasising algorithmic or computational aspects, this treatment of the geometry of folding and unfolding presents over 60 unsolved 'open problems' to spur further research.
650		0	_aPolyhedra _xModels.
650		0	_aPolyhedra _xData Processing.
700	1		_aO'Rourke, Joseph.
908			_a131003
989		7	_a20230822095114.0 _a1401800014
999			_c13753 _d13753