Ghosh, Subir Kumar ; Mount, David M.
(1991)
*An output sensitive algorithm for computing visibility graphs*
SIAM Journal on Computing, 20
(5).
pp. 888-910.
ISSN 0097-5397

Full text not available from this repository.

Official URL: http://epubs.siam.org/sicomp/resource/1/smjcat/v20...

## Abstract

The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertex set consists of 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. This paper presents an algorithm that computes the visibility graph of a 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 Society for Industrial and Applied Mathematics. |

Keywords: | Visibility Graph; Output-sensitive Algorithms; Shortest Paths |

ID Code: | 76273 |

Deposited On: | 31 Dec 2011 08:54 |

Last Modified: | 31 Dec 2011 08:54 |

Repository Staff Only: item control page