Article ID: | iaor19912061 |
Country: | Netherlands |
Volume: | 31 |
Issue: | 1 |
Start Page Number: | 71 |
End Page Number: | 74 |
Publication Date: | Mar 1991 |
Journal: | Discrete Applied Mathematics |
Authors: | Arikati Srinivasa R., Rangan C. Pandu |
One of the fundamental notions in computer geometry is the concept of visibility. A visibility graph has vertices which correspond to geometric components such as points or lines, and edges which correspond to visibility of these components from each other. The proposed algorithm finds a two-pair in an arbitrary graph in O(