An output sensitive algorithm for computing visibility graphs
Subir Ghosh, David M. Mount · Annual Symposium on Foundations of Computer Science · 1987
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.
Cited by 95 works. doi:10.1109/sfcs.1987.6
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
- Data Structures and Algorithms 3 : Multi-dimensional Searching and Computational Geometry
- Data Structures and Algorithms 1: Sorting and Searching
- Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
- A new data structure for representing sorted lists