期刊文献+

基于四边形网格剖分的可计算区域填充方法

Computable Region Filling Method Based on Quadrilateral Mesh Split
下载PDF
导出
摘要 针对在一定形状限制条件下的可形变填充问题,提出一种可计算填充方法。对目标区域和填充样板进行四边形网格剖分。给出在样板拼接、边界、旋转、最小形变等约束条件下的整型规划,使用填充样板在填充区域中进行离散拼接,并通过全局优化迭代样板形变,以达到理想的填充效果。实验结果表明,该填充方法对目标区域的有效覆盖率以及边缘拟合度与约束限制无直接关系,在指定约束条件下,能较好地达到区域填充效果。 This paper proposes a computable filling method, aiming at the problem of deformable filling under certain shape constraint conditions. Quadrilateral mesh split of the target area and filling template is done. Integer planning is presented under constraint conditions such as template connecting, boundary, rotation, minimum deformation, etc. Discrete splicing in filling area is realized using filling template. Through the global optimization, model deformation is iterated, so as to achieve the desired filling effect. Experimental results show that the proposed filling method has no direct relationship with the constraints in domain coverage ratio of target area and edge fitting degree, and it can better achieve region filling under the specified constraints.
出处 《计算机工程》 CAS CSCD 北大核心 2017年第5期299-305,312,共8页 Computer Engineering
基金 国家重点实验室创新基金(ZZKT2013A12) 江苏省科技支撑计划项目(BE2011058 BY2012190)
关键词 四边形网格 区域填充 离散拼接 整型规划 形状约束 全局优化 quadrilateral mesh domain filling discrete splicing integer planning shape constrains global optimization
  • 相关文献

参考文献1

二级参考文献30

  • 1Leung MK, Pang WM, Fu CW, Wong TT, Heng PA. Tileable BTF. IEEE Trans on Visualization and Computer Graphics, 2007,13(5):953-965.
  • 2Zhou H, Sun J, Turk G, Rehg JM. Terrain synthesis from digital elevation models. IEEE Trans. on Visualization and Computer Graphics, 2007,13(4):834-848.
  • 3Lagae A, Dumont O, Dutre P. Geometry synthesis by example. In: Spagnuolo M, Belyaev A, Suzuki H, eds. Proc. of the Int'l Conf. on Shape Modeling and Applications 2005. Washington: IEEE Computer Society, 2005. 176-185.
  • 4Merrell P. Example-Based model synthesis. In: Spencer SN, ed. Proc. of the 2007 Symp. on Interactive 3D Graphics and Games. New York: ACM Press, 2007. 105-112.
  • 5Besl PJ, McKay ND. A method for registration of 3-D shapes. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1992,14(2):239-256.
  • 6Yu Y, Zhou K, Xu D, Shi X, Bao H, Guo B, Shum HY. Mesh editing with poisson-based gradient field manipulation. ACM Trans. on Graphics (TOG), 2004,23(3):644-651.
  • 7Sorkine O, Cohen-Or D, Lipman Y, Alexa M, Rossl C, Seidel HP. Laplacian surface editing. In: Boissonnat JD, Alliez P, eds, Proc, of the 2004 Eurographics/ACM SIGGRAPH Syrup. on Geometry Processing. New York: ACM Press, 2004. 175-184.
  • 8Boykov Y, Veksler O, Zabih R. Fast approximate energy minimization via graph cuts. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2001,23(11): 1222-1239.
  • 9Hable J, Rossignac J. Blister: GPU-Based rendering of Boolean combinations of free-form triangulated shapes. ACM Trans. on Graphics (TOG), 2005,24(3): 1024-1031.
  • 10Bhat P, Ingram S, Turk G. Geometric texture synthesis by example. In: Scopigno R, Zorin D, eds. Proc. of the 2004 Eurographics/ACM SIGGRAPH Symp. on Geometry Processing. New York: ACM Press, 2004. 41-44.

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部