ratering@umn-cs.cs.umn.edu (Steve Ratering) (06/14/91)
If you have a computer program that takes as input a set of polygons in a plane such that the total number of vertices is n, and outputs the visibility graph (an edge exists for each pair of vertices (not necessarily in the same polygon) which can "see each other") in O(n^2 log n) time please email it to me. Thank you. Steve Ratering