DocumentCode :
2185701
Title :
An output sensitive algorithm for computing visibility graphs
Author :
Ghosh, Subirkumar ; Mount, David M.
fYear :
1987
fDate :
12-14 Oct. 1987
Firstpage :
11
Lastpage :
19
Abstract :
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.
Keywords :
Automation; Clocks; Computational geometry; Computer applications; Computer science; Educational institutions; Fingers; Military computing; Sorting; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1987., 28th Annual Symposium on
Conference_Location :
Los Angeles, CA, USA
ISSN :
0272-5428
Print_ISBN :
0-8186-0807-2
Type :
conf
DOI :
10.1109/SFCS.1987.6
Filename :
4568251
Link To Document :
بازگشت