一种平面简单多边形核的求解算法

An Algorithm to Calculate the Kernel of A Plane Simple Polygon

平面简单多边形的核是该多边形内部的一个点集,该点集中任意一点与多边形边界上一点的连线都处于这个多边形内部。可见核的这一性质在摄像机定位等问题上得到了应用,本文提出了一种简单多边形核求解的新方法,该方法不仅可以判断核的存在性,而且可以得到核多边形顶点序列。给出的算法容易理解,便于实现,可以广泛地应用于此类问题的求解。

The kernel of a plane simple polygon is a point set in the interior of this polygon, in which any point can be connected to another arbitrary point on the border of the polygon with a line inside the polygon. The character of kernel finds its application in such fields as the positioning of the camera. We propose a new method to calculate the kernel of a single polygon, which can not only judge the existence of the kernel, but also get the point list of the kernel. The given arithmetic is easy to understand and realize, and can be widely applied to such kind of problems.