搜索


会员资源切换至【手机版】

切换本帖至【手机版】


开启左侧

麻省理工学院开放课程:折纸艺术 Open MIT Course : Geometric Folding Algorithms 更新完毕/全23课[MP4]

[复制链接]
发表于 2021-8-12 20:20:58 | 显示全部楼层 |阅读模式
下载备注说明:


  • 1.有些P2P资源共享较早,会出现无源或暂时无源的情况,如果您喜欢它,请耐心挂机等待。


  • 2. 有些磁力链接无法自动解析,比如:


    [url=magnet:?xt=urn:btih:E1346C46C3736056756E98D2EC22A383D7D2600F&dn=[www.books51.com]太阳之下_幸福北韩 Under.the.Sun.2015.DOCU.1080p.WEB-DL.AAC2.0.H264-FGT 4GB]点击下载[/url]



    可自行选择字符


    [url=


    红色为磁力地址


    ]点击下载


    之间的内容 (红色字符代表要复制的磁力链接代码,选择后点击CRTL+C 复制到下载工具中




  • 游客,本帖隐藏的内容需要积分高于 1 才可浏览,您当前积分为 0


    资源信息:



    中文名


    : 麻省理工学院开放课程:折纸艺术


    英文名


    : Open MIT Course : Geometric Folding Algorithms


    资源格式


    : MP4


    学校


    : 麻省理工学院 MIT


    主讲人


    : Prof. Eric Demaine


    版本


    : 更新完毕/全23课


    发行日期


    : 2010年09月


    地区


    : 美国


    对白语言


    : 英语


    文字语言


    : 英文


    概述


    :



    课程介绍: 院校名称:麻省理工学院 ( Massachusetts Institute of Technology 通常简称:MIT ) 课程名称:Geometric Folding Algorithms: Linkages, Origami, Polyhedra 授课学期:2010年 秋季课程 主讲导师:Eric Demaine 官网主页:http://courses.csail.mit.edu/6.849/fall10/ 当你把一个物体或对象重新配置的时候,几何折迭常常发挥作用.这门课程就是研究关于折迭算法分析与设计如:折纸,多面体等. 主要的应用有:自动化设计全新的和复杂的折纸、通过自我折迭表或链条来变形机器人、如何无碰撞折迭机器人、如何弯曲薄金属片成所需的三维形状........... 基于在数学和算法的认识不断增长,近几年来这些方向去得了重大进展。尽管如此,许多基础问题还是令人着急解决。这门课程涵盖了最先进的折迭研究,包括一系列开放性问题,启发学生在这个领域做更深入的研究....



    该门课程共23课时 每节课都包含1个MP4格式视频 2个PDF电子书 视频为360P标准、配套的2本电子书内容为该节课上用到的讲义 折纸彩图等 btw: 本人英语太烂,欢迎各位纠正、完善课程内容介绍 非常感谢您的参与



    课程面向学生类型:


    We welcome both undergraduate and graduate students from all universities, although officially this is a graduate class.


    以下内容摘自课程主页:


    Whenever you have a physical object to be reconfigured, geometric folding often comes into play. This class is about algorithms for analyzing and designing such folds. Motivating applications include * automated design of new and complex origami * transforming robots by self-folding sheets or chains * how to fold robotic arms without collision * how to bend sheet metal into desired 3D shapes * understanding how proteins fold Major progress have been made in recent years in many of these directions, thanks to a growing understanding of the mathematics and algorithms underlying folding. Nonetheless, many fundamental questions remain tantalizingly unsolved. This class covers the state-of-the-art in folding research, including a variety of open problems, enabling the student to do research and advance the field. We will organize an optional problem-solving session, during which we can jointly try to solve open problems in folding. In the past, these sessions have led to important new results and published papers, as well as class projects. Class projects more generally can take the form of folding-inspired sculptures; formulations of clean, new open problems; implementations of existing algorithms; or well-written descriptions of one or more papers in the area. Projects can be purely mathematical (geometric) and/or theoretical computer science (algorithmic/complexity theoretic) and/or artistic. Students are also required to do a project presentation and a small number of problem sets. Topics: This is an advanced class on computational geometry focusing on folding and unfolding of geometric structures including linkages, proteins, paper, and polyhedra. Examples of problems considered in this field: * What forms of origami can be designed automatically by algorithms? * What shapes can result by folding a piece of paper flat and making one complete straight cut? * What polyhedra can be cut along their surface and unfolded into a flat piece of paper without overlap? * When can a linkage of rigid bars be untangled or folded into a desired configuration? Many folding problems have applications in areas including manufacturing, robotics, graphics, and protein folding. This class covers many of the results that have been proved in the past few years, as well as the several exciting open problems that remain open.



    课程中提到的教材: Textbook The textbook for the class is Geometric Folding Algorithms: Linkages, Origami, Polyhedra by Erik Demaine and Joseph O'Rourke, published by Cambridge University Press (2007). The list price for the hardback is $99. Nine copies will be available at the MIT Coop at this price. Amazon offers a sale price of $79. A further reduced price is available as part of a bulk class purchase; let Erik know if you want to be part of it. Additional recommended reading is Origami Design Secrets: Mathematical Methods for an Ancient Art by Robert Lang.



    Previous Offerings This class was offered twice before under the class number 6.885, in Fall 2007 and Fall 2004. You might be interested in the lecture notes, problem sets, etc. from those offerings.


    课程截图预览:
























    目录


    :



    [公告]公开招募VeryCD U 开放课程整理、发布人员报名 点此进入





    希望更多的网友加入到国外名校开放课程整理、发布的队伍中来...




    资源来自网络收集 未经过一 一的质量 安全等检测 只是把收集的资源和各位驴友分享 仅作网络学习交流使用 请勿用于商业用途 ! 希望各位下载的驴友能多多参与分流保源





    主题推广




    回复

    使用道具 举报

    您需要登录后才可以回帖 登录 | 立即注册

    本版积分规则

    随缘推荐

    切换至【手机版】| 主站| Archiver|

    JS of wanmeiff.com and vcpic.com Please keep this copyright information, respect of, thank you!JS of wanmeiff.com and vcpic.com Please keep this copyright information, respect of, thank you!

    |网站地图

    GMT+8, 2026-6-15 06:39 , Processed in 0.379679 second(s), 112 queries .

     

    快速回复 返回顶部 返回列表