Abstract: The kernel of simple polygon is a point set within the polygon where all boundaries of polygon are visible from any point within the kernel.A new algorithm based on the conclusions available in references is introduced which can quickly determine whether the kernel of simple polygon is empty，and easily find a vertex of kernel when the kernel is not empty.Through uncomplicated generalization the algorithm can find an edge of kernel and then the kernel itself.It is comprehensible and practical to implement.