Combinatorial aspects of geometric graphs

As a special case of our main result, we show that for all L > 0, each k-nearest neighbor graph in d dimensions excludes K(h) as a depth L minor if h = Omega(L(d)). More generally, we prove that the overlap graphs defined by Miller, Teng, Thurston and Vavasis (1993) have this combinatorial property. By a construction of Plotkin, Rao and Smith (1994), our result implies that overlap graphs have "good" cut-covers, answering an open question of Kaklamanis, Krizanc and Rao (1993). Consequently, overlap graphs can be emulated on hypercube graphs with a constant factor of slow-down and on butterfly graphs with a factor of O(log*n) slow-down. Therefore, computations on overlap graphs, such as finite element and finite difference methods on "well-conditioned" meshes and image processing on k-nearest neighbor graphs, can be performed on hypercubic parallel machines with a linear speed-up. Our result, in conjunction with a result of Plotkin, Rao and Smith, also yields a combinatorial proof that overlap graphs have separators of sublinear size. We also show that with high probability, the Delaunay diagram, the relative neighborhood graph, and the k-nearest neighbor graph of a random point set exclude K(h) as a depth L minor if h = Omega(L(d/2) logn). (C) 1998 Elsevier Science B.V.