Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
414750 | Computational Geometry | 2014 | 12 Pages |
Abstract
We study a new class of visibility problems based on the notion of α-visibility. Given an angle α and a collection of line segments SS 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri-Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh,