LR-visibility in a simple polygon plays an important role in many geometric problems, such as two-guard and polygon search problems. The study on which has important theoretical significance and practical value in computational geometry. Based on the characteristics of the simple polygons, analyzing the relationship between the number of non-redundant components and LR-visibility, combined with the necessary and sufficient conditions to determine whether a simple polygon is LR-visible or not, this paper puts forward an algorithm for computing the number of non-redundant components. According to this algorithm and the necessary and sufficient conditions, we can determine whether a simple polygon is LR-visible or not. Particularly, we realize the algorithm with C++ program. The experiment result shows that the algorithm is correct and practicable.
展开▼
