Abstract
We study a new class of visibility problems based on the notion of α-visibility. Given an angle α and a collection of line segments 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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Ghodsi, M., Maheshwari, A., Nouri, M., Sack, J. R., & Zarrabi-Zadeh, H. (2012). α-visibility. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7357 LNCS, pp. 1–12). https://doi.org/10.1007/978-3-642-31155-0_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
