MIT折纸算法

该博客探讨了MIT的折纸算法,涉及几何对象如刚性杆件、无拉伸无撕裂无交叉的纸张和切割表面的多面体。主要问题包括折纸的可行性和设计,以及决定折纸算法的效率和难度。博客内容涵盖连杆系统的通用性和刚性,纸张折叠设计的可能性,以及多面体的展开和铰链分解。还讨论了如何将任何形状从长条状纸张折叠,并证明了对于任意面积相同的有限集合,可以折叠成一条无碰撞的链。
摘要由CSDN通过智能技术生成

vedio 1

Geomefric objects

1 linkage: rigid bars
2 paper: no stretch, no tears, no crossing
3 polyhedra: cut surface, one piece, no overlap

Question

Foldability: What structures fold at all/in particular way?
Design: What shapes (or particular property) can be folded & how?

Result

Universality: everything can be folded + algorithm
Decision: efficient algorithm to decide foldability
Hardness: computationally in fractable to decide foldability

1 linkages

Early motivation: convert
linear motion circular motion

Universality: linkage to sign your name (trace piecewise polynomial curve)
Rigidity: does a linkage fold at all?

linkages forbidding intersection

Reconfiguration: fold from config.A
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值