An output sensitive algorithm for computing visibility graphs
- 1 October 1987
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 15 (02725428) , 11-19
- https://doi.org/10.1109/sfcs.1987.6
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
This publication has 10 references indexed in Scilit:
- Fibonacci Heaps And Their Uses In Improved Network Optimization AlgorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Finding the visibility graph of a simple polygon in time proportional to its sizePublished by Association for Computing Machinery (ACM) ,1987
- Visibility of disjoint polygonsAlgorithmica, 1986
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Data Structures and Algorithms 1Published by Springer Nature ,1984
- A new data structure for representing sorted listsActa Informatica, 1982
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- A new representation for linear listsPublished by Association for Computing Machinery (ACM) ,1977