An Output-Sensitive Algorithm for Computing Visibility Graphs
Subir Ghosh, David M. Mount · SIAM Journal on Computing · 1991
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.
Cited by 246 works. doi:10.1137/0220055
Authors
References
- An algorithm for planning collision-free paths among polyhedral obstacles
- Fibonacci heaps and their uses in improved network optimization algorithms
- Set Merging Algorithms
- Euclidean shortest paths in the presence of rectilinear barriers
- On Shortest Paths in Polyhedral Spaces
- A linear-time algorithm for a special case of disjoint set union
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Constructing the visibility graph for n-line segments in O(n2) time
- Data Structures and Algorithms 1
- Visibility of disjoint polygons