Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
de Berg M, van Kreveld M, Overmars M et al (1997) Computational geometry: algorithm and applications, 2nd edn. Springer, Berlin
Tan X, Zhang J, Jiang B (2010) Simple characterization of LR-visibility polygons. In: 9th international conference, CGGA 2010, Dalian, China
Das G, Heffernan PJ, Narasimhan G (1997) LR-visibility in polygons. Comp Geom Theory Appl 7(1):37–57
Suzuki I, Yamashita M (1992) Searching for mobile intruders in a polygonal region. SIA- M J Comp 21(5):863–888
Heffernan PJ (1996) An optimal algorithm for the two-guard problem. Int J Comput Geom Appl 6(1):15–44
Tan X (2008) A unified and efficient solution to the room search problem. Comput Geom Theory Appl 40(1):45–60
Tan X (2009) Searching a polygonal region by a boundary searcher. J Comput Sci Technol 24:505–516
Acknowledgments
This work is supported by National Natural Science Foundation of China (No. 61173034) and the General Project of Liaoning Province Science and Research (No. L2012487).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Wei, Q., Shi, Y., He, D. (2013). The Research on Algorithm of Determining LR-Visibility in a Simple Polygon. In: Lu, W., Cai, G., Liu, W., Xing, W. (eds) Proceedings of the 2012 International Conference on Information Technology and Software Engineering. Lecture Notes in Electrical Engineering, vol 211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34522-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-34522-7_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34521-0
Online ISBN: 978-3-642-34522-7
eBook Packages: EngineeringEngineering (R0)