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

基于学习的二维不规则形状装箱

Learning based 2D Irregular Shape Packing

LightSpeed Studios(光子工作室群);Shandong University(山东大学)

Zeshi Yang, Zherong Pan, Manyi Li, Kui Wu, Xifeng Gao

AI总结:

本文提出一种学习辅助的二维不规则形状装箱方法,通过深度神经网络将UV贴片分组为近似矩形超级贴片并优化其位姿,在三个数据集上以线性时间复杂度和竞争性速度实现了高于多个基线的装箱率。

摘要:

二维不规则形状装箱是将三维模型的UV贴图片段排列到纹理图集中所必需的一步,以便在计算机图形学中实现内存高效的外观渲染。作为一个涉及所有贴片位置和朝向的联合组合决策问题,该问题具有众所周知的NP难复杂度。此前的解决方案要么假设一种启发式装箱顺序,要么修改上游网格切割和UV映射以简化问题,这要么限制了装箱率,要么带来鲁棒性或通用性问题。相反,我们提出了一种学习辅助的二维不规则形状装箱方法,该方法在输入要求极低的情况下实现较高的装箱质量。我们的方法迭代地选择UV贴片子集并将其分组成近似矩形的超级贴片,从而实质上将问题简化为装箱问题,并在此基础上采用联合优化以进一步提高装箱率。为了高效处理包含数百个贴片的大规模问题实例,我们训练深度神经网络策略来预测近似矩形的贴片子集并确定它们的相对位姿,从而使时间随贴片数量呈线性扩展。我们在三个UV装箱数据集上验证了方法的有效性,结果表明,与多个广泛使用的基线方法相比,我们的方法在具有竞争力的计算速度下实现了更高的装箱率。

英文摘要:

2D irregular shape packing is a necessary step to arrange UV patches of a 3D model within a texture atlas for memory-efficient appearance rendering in computer graphics. Being a joint, combinatorial decision-making problem involving all patch positions and orientations, this problem has well-known NP-hard complexity. Prior solutions either assume a heuristic packing order or modify the upstream mesh cut and UV mapping to simplify the problem, which either limits the packing ratio or incurs robustness or generality issues. Instead, we introduce a learning-assisted 2D irregular shape packing method that achieves a high packing quality with minimal requirements from the input. Our method iteratively selects and groups subsets of UV patches into near-rectangular super patches, essentially reducing the problem to bin-packing, based on which a joint optimization is employed to further improve the packing ratio. In order to efficiently deal with large problem instances with hundreds of patches, we train deep neural policies to predict nearly rectangular patch subsets and determine their relative poses, leading to linear time scaling with the number of patches. We demonstrate the effectiveness of our method on three datasets for UV packing, where our method achieves a higher packing ratio over several widely used baselines with competitive computational speed.

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

↑