计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (23): 193-196.DOI: 10.3778/j.issn.1002-8331.2008.23.058

• 图形、图像、模式识别 • 上一篇    下一篇

基于形状特征的可避免自交的平面多边形变形

刘 婕   

  1. 西安邮电学院 应用数理系,西安 710061
  • 收稿日期:2008-04-02 修回日期:2008-06-23 出版日期:2008-08-11 发布日期:2008-08-11
  • 通讯作者: 刘 婕

Shape feature-based and intersection-free morph of planar polygons

LIU Jie   

  1. Department of Mathematics and Physics,Xi’an University of Post and Telecommunications,Xi’an 710061,China
  • Received:2008-04-02 Revised:2008-06-23 Online:2008-08-11 Published:2008-08-11
  • Contact: LIU Jie

摘要: 给出了平面简单多边形的一种基于形状特征的可避免自交的变形方法。该方法将初始和目标多边形分别嵌入到以其放大的凸包边界为边界的同构平面三角网格中,通过采用对所嵌入的同构网格进行变形的方法,实现了平面多边形的变形。与已有的Surazhsky和Gotsman的方法相比,该方法考虑了初始和目标多边形的几何轮廓及其差异性,故变形过程更加自然,而且在网格剖分时使用了更少的额外顶点,因而提高了算法速度。

关键词: 变形, 多边形, 避免自交, 凸包, 同构平面三角网格

Abstract: This paper presents a shape feature-based and intersection-free method for morphing two planar simple polygons,which completes the morph of the source polygon to the target one by embedding them in the compatible planar triangulations whose boundaries are the boundaries of the magnified convex hull of them respectively,then morphing the triangulations with the method by this paper’s first author and other people.In contrast with the existing method by Surazhsky and Gotsman,the author takes into consideration the geometric contours as well as the differences of the source and target polygons,so the morph is possibly more natural,on the other hand,the triangulation uses further less steiner vertices,so the efficiency is improved.

Key words: morphing, polygon, intersection-free, convex hull, compatible planar triangulation