Scientific Annals of Computer Science

"Alexandru Ioan Cuza" University of Iaşi

Algorithms for Optimally Computing in-line Visibility and Their Applications.

Published in Volume XVI, 2006, p. 39-50, doi:

Authors: Mirel Coşulschi and Mihaela Sterpu


In this paper, we approach a comparative study of two algorithms for calculating vertical segments visibility in certain situations. The first algorithm, Visibility, can be easily classified as a brute-force one, while the second algorithm is more elaborate, involving a better understanding of the problem and its peculiarity. A refinement of the second algorithm using the convex hull of a monotone polygon is derived. A thorough study of complexity of these algorithms is performed. An application of the visibility reporting algorithm to the efficient placement of some facilities in a practical problem is also given.


© 2006-2018 FII | Contact: annals at