New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Graphics in Flatland revisited
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Visibility with a moving point of view
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Dynamically maintaining configurations in the plane (Detailed Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Segment endpoint visibility graphs are Hamiltonian
Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
| Hi-index | 0.00 |