Computing depth orders and related problems

Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 ε 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 log6 n). (ii) If K: is a set of n convex and simply-shaped objects whose xy-projections are all ‘fat’ and their sizes axe within a constant ratio from one another, then a depth order for K: can be computed in time O(nλs1/2 12 (n)log4 n), where s is the maximum number of intersections between the xy-projections of the boundaries of any pair of objects in/C.

Original languageEnglish
Title of host publicationAlgorithm Theory – SWAT 1994 - 4th Scandinavian Workshop on Algorithm Theory, Proceedings
EditorsErik M. Schmidt, Sven Skyum
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540582182
StatePublished - 1994
Event4th Scandinavian Workshop on Algorithm Theory, SWAT 1994 - Aarhus, Denmark
Duration: 6 Jul 19948 Jul 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume824 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th Scandinavian Workshop on Algorithm Theory, SWAT 1994


FundersFunder number
Israeli Academy of Sciences
U.S.-Israeli Binationa| Science Foundation
National Science FoundationCCR-93-01259, CCR-91-22103
German-Israeli Foundation for Scientific Research and Development


    Dive into the research topics of 'Computing depth orders and related problems'. Together they form a unique fingerprint.

    Cite this