A MATLAB code for finding the kernel of a simple polygon

This paper presents an algorithm for determining the kernel of a simple polygon. Traditional algorithms typically define the kernel by intersecting carefully chosen half-planes. In contrast, we explore a less-used approach as described in Zhao and Wang, (2010) , that handles concave vertices of the polygon as part of the kernel computation. This approach leverages two key techniques. First, it intersects the polygon’s interior with lines passing through edges adjacent to concave vertices. Second, it analyzes the orientations of two specific triangles identified by the sequence of vertices defining the line segment’s endpoints. This method for ray-line segment intersection plays a crucial role in efficiently determining the kernel. While the original approach effectively determines the kernel for a subset of simple polygons, it has limitations in handling all possible cases. This paper addresses these limitations by presenting a refined algorithm that expands the applicability of the method. The enhanced algorithm is implemented in MATLAB and validated through extensive testing to ensure its accuracy and efficiency.