Efficient ways of performing graph search on intersection
graphs of geometric objects are proposed.  Also, an efficient
data structure for half dynamic segment intersection search is
developed, and, incorporating this with the above methods, many
problems related to VLSI layout design are shown to be solved
efficiently.