期刊文献+

基于简化多边形类正切空间表示的图形渐变算法 被引量:9

Shape Blending Based on Representation of Simplified Polygons in the Similar Tangent Space
下载PDF
导出
摘要 采用多边形简化的方法提取出包含源图形主要特征点的多边形.在简化多边形的类正切空间表示下,利用图形对应边在渐变过程中所掠过面积总和最小这一特征构造相似度量函数,由动态规划算法求解实现初始和目标简化多边形之间的顶点对应,再进一步建立源图形顶点之间的整体对应,最后通过插值边和角的方法实现图形渐变.实验结果表明:该算法简单有效,对应效果自然、合理. This paper presents an effective approach for establishing vertex correspondence between two planar shapes. Correspondences were first established between the major feature points extracted from both simplified polygons of source and target shapes. We used the representation of the simplified polygons in the similar tangent space to construct a new similarity metric function by the fact that the corresponding edges transformed to each other with the minimum total amount of moving area. The resulting solution tended to associate regions on the two shapes which looked alike. Then the optimal correspondence was obtained by an efficient dynamic programming technique, meanwhile, we could attain the shape blending between the planar shapes using intrinsic method. Experimental results show that our method is fast, robust, and feature preserving.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2007年第3期304-310,共7页 Journal of Computer-Aided Design & Computer Graphics
关键词 简化多边形 主特征点 类正切空间 相似度量函数 动态规划图 simplified polygon major feature point similar tangent space similarity metric function dynamic programming (DP) graph
  • 相关文献

参考文献9

  • 1Sederberg T W,Greenwood E.A physically based approach to 2D shape blending[J].Computer Graphics,1992,26(2):25-34
  • 2Zhang Yuefeng.A fuzzy approach to digital image warping[J].IEEE Computer Graphics and Applications,1996,16(7):34-41
  • 3Cohen S,Elber G,Bar-Yehuda R.Matching of freeform curves[J].Computer-Aided Design,1997,29(5):369-378
  • 4Lin Ligang,Wang Guopu,Zhang Bo,Guo Baining,et al.Perceptually based approach for planar morphing[C]//Proceedings of Pacific Graphics'2004,IEEE Computer Society,Seoul,2004:111-120
  • 5Mortara M,Spagnuolo M.Similarity measures for blending polygonal shapes[J].Computers & Graphics,2001,25(1):13-37
  • 6Sederberg T W,Gao P,Wang G,et al.2D shape blending:an intrinsic solution to the vertex path problem[C]//Computer Graphics Proceedings,Annual Conference Series,ACM SIGGRAPH,New York,1993:15-18
  • 7刘文予,李华,朱光喜.物体变形的广义形态变换方法[J].计算机辅助设计与图形学学报,2004,16(2):222-227. 被引量:6
  • 8Latecki Longin Jan,Lakmper Rolf.Convexity rule for shape decomposition based on discrete contour evolution[J].Computer Vision and Image Understanding,1999,73(3):441-454
  • 9Chetverikov D,Szabo Z.A simple and efficient algorithm for detection of high curvature points in planar curves[C]//Proceedings of the 23rd Workshop of the Austrian Pattern Recognition Group,Budapest,1999:175-184

二级参考文献10

  • 1Tsuhan C, Ram R. Audio-visual integration in multimedia communication[J]. Proceedings of IEEE, 1998, 86(5): 837~852
  • 2Thalmann N M, et al. Face to virtual face[J]. Proceedings of IEEE, 1998, 85(5): 871~883
  • 3Lazarus F, Verroust A. 3D metamorphosis: A survey[J]. The Visual Computer, 1998, 14(2): 373~389
  • 4Cohen-or D, Levin D, Solomovoci A. Three-dimensional distance field metamorphosis[J]. ACM Transactions on Graphics, 1998, 17(2): 116~141
  • 5Kaul A, Rossignac J. Solid-interpolating deformations: Construction and animation of PIPs[J]. Computers & Graphics, 1992, 16(1): 107~115
  • 6Wang Fei, Liu Wenyu, Li Hua. An algorithm for convex decomposition for polyhedral object[A]. In: Proceedings of International Conference on Computer Aided Design and Computer Graphics, Kunming, 2001, 2: 822~824
  • 7Ohbuchi R, Kokojima Y, Takahashi S. Blending shape by using subdivision surfaces[J]. Computers & Graphics, 2001, 25(2): 211~223
  • 8Mortara M, Spagnuolo M. Similarity measures for blending polygonal shapes[J]. Computers & Graphics, 2001, 25(2): 13~27
  • 9刘文予,李华,朱光喜.凸多面体的快速形态和算法[J].软件学报,2001,12(10):1510-1515. 被引量:2
  • 10刘文予,朱光喜.基于广义形态内插的非刚体运动描述方法[J].软件学报,2001,12(10):1544-1551. 被引量:4

共引文献5

同被引文献54

引证文献9

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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