Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (17): 166-168.DOI: 10.3778/j.issn.1002-8331.2010.17.047

• 图形、图像、模式识别 • Previous Articles     Next Articles

New algorithm to calculate kernel of simple polygon

WANG Hong-yan1,LIU Run-tao2,WANG San1   

  1. 1.College of Applied Sciences,Harbin University of Science and Technology,Harbin 150080,China
    2.Institute of Information and Scientific Computing Technology,Harbin University of Science and Technology,Harbin 150080,China
  • Received:2008-11-28 Revised:2009-02-02 Online:2010-06-11 Published:2010-06-11
  • Contact: WANG Hong-yan

简单多边形核求解新算法

王洪艳1,刘润涛2,王 三1   

  1. 1.哈尔滨理工大学 应用科学学院,哈尔滨 150080
    2.哈尔滨理工大学 信息与科学计算技术研究所,哈尔滨 150080
  • 通讯作者: 王洪艳

Abstract: The kernel of a simple polygon is a point set in the interior of this polygon,and the line from any point in the point set to any point on the boundary of the polygon is completely located inside the polygon.This property of kernel finds its application in such fields as the positioning of the monitor.This paper inspects the properties in constitution of kernel of simple polygon,and a new algorithm for calculating the kernel of a simple polygon is proposed combined with the existing achievement.This algorithm can quickly report if kernel of simple polygon is empty,and can quickly get the point list of the kernel when the kernel exists.The new algorithm is easy to understand and realize,and can be widely applied in the practical problems.

Key words: simple polygon, kernel, computational geometry, clip

摘要: 简单多边形的核是位于多边形内部的一个点集,而且这个点集中的任意一点与多边形边界上的任意点的连线都属于这个多边形的内部。核的这一性质在监视器安放等问题上得到了应用。考察了简单多边形的核在构成方面的性质,结合已有的成果,提出了一种求简单多边形核的新算法。该算法可以较快地对多边形的核为空的情况加以报告,而且在有核的情况下快速求解到核多边形的顶点序列。新的求核算法容易理解,而且易于实现,可以广泛地应用于实际问题。

关键词: 简单多边形, 核, 计算几何, 裁剪

CLC Number: