Fast Algorithm for Discrimination of Simple Polygon Seedless

Nuclear of simple polygon is a set of points inside the polygon, any one of which can be seen from all the boundaries of the polygon. According to the fact that the nuclear of polygon only relates to the polygon pits, it only needs to deal with the pitsof the polygon.When there are continuous pits in one polygon, using the parallel ray method and linear intersection method can quickly determine whether the polygon has nuclear. When the polygon has nuclear, the time complexity of the node of polygon nuclear can be calculated.