An output sensitive algorithm for computing visibility graphs

Subir Kumar, Ghosh ; Mount, D. M. (1987) An output sensitive algorithm for computing visibility graphs Proceedings - Annual Symposium on Foundations of Computer Science . pp. 11-19. ISSN 0272-5428

Full text not available from this repository.

Official URL:

Related URL:


The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertices are the vertices of the obstacles and whose edges are pairs of vertices (u, v) such that the open line segment between u and v does not intersect any of the obstacles. The visibility graph is an important combinatorial structure in computational geometry and is used in applications such as solving visibility problems and computing shortest paths. An algorithm is presented that computes the visibility graph of s set of obstacles in time O(E + n log n), where E is the number of edges in the visibility graph and n is the total number of vertices in all the obstacles.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
ID Code:76288
Deposited On:31 Dec 2011 08:54
Last Modified:31 Dec 2011 08:54

Repository Staff Only: item control page