Computing Depth Orders and Related Problems

Let K be a set of n non-intersecting objects in 3-space. A depth order of K, if exists, is a linear order ! of the objects in K such that if K;L 2 K and K lies vertically below L then K ! L. We present a new technique for computing depth orders, and apply it to several special classes of objects. Our results include: (i) If K is a set of n triangles whose xy-projections are all `fat', then a depth order for K can be computed in time O(n log 5 n). (ii) If K is a set of n convex and simply-shaped objects whose xy-projections are all `fat' and their sizes are within a constant ratio from one another, then a depth order for K can be computed in time O(n 1=2 s (n) log 4 n), where s is the maximum number of intersections between the boundaries of the xy-projections of any pair of objects in K, and s (n) is the maximum length of (n; s) Davenport-Schinzel sequences