Learn More
Abetract We study several variants of the problem of cutting line segments in space in order to eliminate all cycles in their depth order, Our results include: (a) an output-sensitive algorithm for the general case (its performance depends on the minimum number of cuts needed to eliminate all cycles); (b) an O(ngi6 logn) algorithm for the case of 'bipartite(More)
  • 1