arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.10213cs.GR
收藏

Surface2Volume:符合可装配体划分的曲面分割

Surface2Volume: Surface Segmentation Conforming Assemblable Volumetric Partition

Chrystiano Araújo, Daniela Cabiddu, Marco Attene, Marco Livesu, Nicholas Vining, Alla Sheffer

摘要:

用户经常寻求制造其外表面由具有不同表面属性(例如颜色或材料)的区域组成的对象。在单件中制造这样的物体通常具有挑战性,甚至是不可能的。另一种方法是将它们划分为单属性体积零件,这些零件可以单独制造,然后组装以形成目标对象。为了促进这种方法,需要将输入模型划分为符合表面分割的部分,并且可以在没有碰撞的情况下移动。我们提出了Surface2Volume,分区算法能够产生这样的可组装的部分,其中每一个是附属于一个单一的属性,其组装的外表面符合输入表面的几何形状和分割。在计算分区时,我们严格遵守表面分割和可装配性,并通过最小化零件数量、促进零件简化和简化装配顺序来优化制造。我们注意到,计算所需的分区需要解决三种类型的变量:每部分的装配轨迹,分区拓扑结构,即分离不同部件的接口表面的连接性,以及这些接口的几何形状或位置。我们有效地产生所需的分区,解决一种类型的变量的时间:首先计算的装配轨迹,然后确定接口拓扑结构,最后计算接口的位置,允许零件的可装配性。我们在算法上识别需要顺序组装的输入,并通过每次计算和拆卸可组装部件的子集来逐步划分这些输入。我们展示我们的方法....

英文摘要:

Users frequently seek to fabricate objects whose outer surfaces consist of regions with different surface attributes, such as color or material. Manufacturing such objects in a single piece is often challenging or even impossible. The alternative is to partition them into single-attribute volumetric parts that can be fabricated separately and then assembled to form the target object. Facilitating this approach requires partitioning the input model into parts that conform to the surface segmentation and that can be moved apart with no collisions. We propose Surface2Volume, a partition algorithm capable of producing such assemblable parts, each of which is affiliated with a single attribute, the outer surface of whose assembly conforms to the input surface geometry and segmentation. In computing the partition we strictly enforce conformity with surface segmentation and assemblability, and optimize for ease of fabrication by minimizing part count, promoting part simplicity, and simplifying assembly sequencing. We note that computing the desired partition requires solving for three types of variables: per-part assembly trajectories, partition topology, i.e. the connectivity of the interface surfaces separating the different parts, and the geometry, or location, of these interfaces. We efficiently produce the desired partitions by addressing one type of variables at a time: first computing the assembly trajectories, then determining interface topology, and finally computing interface locations that allow parts assemblability. We algorithmically identify inputs that necessitate sequential assembly, and partition these inputs gradually by computing and disassembling a subset of assemblable parts at a time. We demonstrate our method....

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑