.png){kind=icon}
返回
Computational Object-Wrapping Rope Nets
.png){kind=icon}
PRE
AI
DOI：10.1145/3476829.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Wrapping objects using ropes is a common practice in our daily life. However, it is difficult to design and tie ropes on a 3D object with complex topology and geometry features while ensuring wrapping security and easy operation. In this article, we propose to compute a rope net that can tightly wrap around various 3D shapes. Our computed rope net not only immobilizes the object but also maintains the load balance during lifting. Based on the key observation that if every knot of the net has four adjacent curve edges, then only a single rope is needed to construct the entire net. We reformulate the rope net computation problem into a constrained curve network optimization. We propose a discrete-continuous optimization approach, where the topological constraints are satisfied in the discrete phase and the geometrical goals are achieved in the continuous stage. We also develop a hoist planning to pick anchor points so that the rope net equally distributes the load during hoisting. Furthermore, we simulate the wrapping process and use it to guide the physical rope net construction process. We demonstrate the effectiveness of our method on 3D objects with varying geometric and topological complexity. In addition, we conduct physical experiments to demonstrate the practicability of our method.
Keyword:
Euler tour theorem
rope net
hoisting
期刊
IF:
9.5
论文数:
4.8K
被引数:
3.6W
机构
引用论文
Isolation and characterization of the mouse corticotropin‐β‐lipotropin precursor gene and a related pseudogene.png)
FEBS Letters
OAAI
FEBS LettersIF0
OAAI分享收藏En Bloc Perfluorodissection for Tractional Retinal Detachment in Proliferative Diabetic Retinopathy
PREAI
分享收藏
分享收藏
查看更多内容