We study a new class of visibility problems based on the notion of α-visibility. Given an angle α and a collection of line segments S in the plane, a segment t is said to be α-visible from a point p, if there exists an empty triangle with one vertex at p and the side opposite to p on t such that the angle at p is α. In this model of visibility, we study the classical variants of point visibility, weak and complete segment visibility, and the construction of the visibility graph. We also investigate the natural query versions of these problems, when α is either fixed or specified at query time.
|Keywords||Approximate visibility, Shortest paths, Visibility, Visibility queries, Weak visibility|
Ghodsi, M. (Mohammad), Maheshwari, A, Nouri-Baygi, M. (Mostafa), Sack, J.-R, & Zarrabi-Zadeh, H. (Hamid). (2014). α-Visibility. Computational Geometry, 47(3 PART A), 435–446. doi:10.1016/j.comgeo.2013.10.004