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
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Visibility and intersectin problems in plane geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
Triangulation and shape-complexity
ACM Transactions on Graphics (TOG)
Fast Triangulation of Simple Polygons
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Intersecting line segments in parallel with an output-sensitive number of processors
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Searching for empty convex polygons
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An algorithm for generalized point location and its applications
Journal of Symbolic Computation
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Optimal link path queries in a simple polygon
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Optimal finger search trees in the pointer machine
Journal of Computer and System Sciences - STOC 2002
An output sensitive algorithm for computing visibility graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Industrial design using interpolatory discrete developable surfaces
Computer-Aided Design
Quasi-Monte-Carlo methods and the dispersion of point sequences
Mathematical and Computer Modelling: An International Journal
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
Let P be a given simple polygon with n sides. The visibility graph of P has an edge between every pair of polygon vertices that can be connected by an open segment in the interior of P. We describe an algorithm that finds the visibility graph of P in &Ogr;(m + n log log n) time, where m is the number of edges in the visibility graph. Because m can be as small as &Ogr;(n), the algorithm improves on the more general visibility algorithms of Asano et al. [AAGHI] and Welzl [W], which take &THgr;(n2) time.