Weak visibility counting in simple polygons
作者：
Highlights：
• Studying weak visibility counting problem for line segments in simple polygons.
• Presenting several exact algorithms, and showing a trade-off between preprocessing costs and query time costs.
• Presenting an approximation algorithm for the problem, and reducing preprocessing costs.
摘要
•Studying weak visibility counting problem for line segments in simple polygons.•Presenting several exact algorithms, and showing a trade-off between preprocessing costs and query time costs.•Presenting an approximation algorithm for the problem, and reducing preprocessing costs.
论文关键词：Computational geometry,Weak visibility,Visibility counting
论文评审过程：Received 7 July 2014, Revised 8 December 2014, Available online 23 April 2015, Version of Record 15 May 2015.
论文官网地址：https://doi.org/10.1016/j.cam.2015.04.018
