Geometric Folding Algorithms

Geometric Folding Algorithms pdf epub mobi txt 电子书 下载 2025

出版者:Cambridge University Press
作者:Erik D Demaine
出品人:
页数:488
译者:
出版时间:2008-8-21
价格:GBP 35.99
装帧:Paperback
isbn号码:9780521715225
丛书系列:
图书标签:
  • 算法 
  • 数学 
  • 折纸 
  • Math 
  • 看名字貌似很好玩 
  • 材料学 
  • 【教材】 
  • Mathematics 
  •  
想要找书就要到 图书目录大全
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

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.

具体描述

读后感

评分

评分

评分

评分

评分

用户评价

评分

做作手册备查吧,Miur-ori origami 扫过吧 ch4

评分

做作手册备查吧,Miur-ori origami 扫过吧 ch4

评分

做作手册备查吧,Miur-ori origami 扫过吧 ch4

评分

做作手册备查吧,Miur-ori origami 扫过吧 ch4

评分

做作手册备查吧,Miur-ori origami 扫过吧 ch4

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有