Abstract
Given a simple polygon in the plane, we study the problem of computing the weak visibility polygon from any query line segment in the polygon. This is a basic problem in computational geometry and has been studied extensively before. In this paper, we present new algorithms and data structures that improve the previous results. © Springer-Verlag 2012.
Cite
CITATION STYLE
Chen, D. Z., & Wang, H. (2012). Weak visibility queries of line segments in simple polygons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7676 LNCS, pp. 609–618). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
