1. Visibility of disjoint polygons;Asano;Algorithmica,1986
2. Topologically sweeping an arrangement;Edelsbrunner;Proc. 18th Ann. ACM Symp. on Theory of Computing,1986
3. Fibonacci heaps and their uses in improved network optimization algorithms;Fredman;Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science,1984
4. Proximity and reachability in the plane;Lee,1979
5. R. Pollack and E. Welzl, Private communication.