Visibility of disjoint polygons
Algorithmica
Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
On shortest paths in polyhedral spaces
SIAM Journal on Computing
Finding the visibility graph of a simple polygon in time proportional to its size
SCG '87 Proceedings of the third annual symposium on Computational geometry
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
An algorithm for generalized point location and its applications
Journal of Symbolic Computation
A new cognition-based chat system for avatar agents in virtual space
VRCAI '08 Proceedings of The 7th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry
Continuous obstructed nearest neighbor queries in spatial databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Intelligent control for wall climbing robot
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
Weak visibility of two objects in planar polygonal scenes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Continuous nearest-neighbor search in the presence of obstacles
ACM Transactions on Database Systems (TODS)
Virtual Stretched String: An Optimal Path Planning Technique over Polygonal Obstacles
Proceedings of Conference on Advances In Robotics
| Hi-index | 0.00 |
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.