首页> 外文期刊>Pattern recognition letters >3d Shape Recursive Decomposition By Poisson Equation
【24h】

3d Shape Recursive Decomposition By Poisson Equation

机译:泊松方程的3d形状递归分解

获取原文
获取原文并翻译 | 示例
           

摘要

This paper proposes a novel algorithm that decomposes the 3D shape into meaningful parts based on Poisson equation. The whole algorithm is divided into three steps. Firstly, shape signature is defined with Poisson equation. Secondly, the binary decomposition based on shape signature is recursively performed to get a coarse decomposition result. Finally, the graph-based minimum cut is used to refine the jaggy boundaries in the initial result. The proposed algorithm not only obtains a set of meaningful parts, but also is robust in the case of deformation, rotation and other transformations. Furthermore, it can process large 3D shapes in an efficient way.
机译:本文提出一种新颖的算法,该算法基于泊松方程将3D形状分解为有意义的部分。整个算法分为三个步骤。首先,利用泊松方程定义形状签名。其次,递归地执行基于形状签名的二进制分解以获得粗略的分解结果。最后,基于图形的最小切割用于细化初始结果中的锯齿状边界。所提出的算法不仅获得了一组有意义的部分,而且在变形,旋转和其他变换的情况下也很健壮。此外,它可以有效地处理大型3D形状。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号