@article{4070,
  abstract     = {Let S be a set of n closed intervals on the x-axis. A ranking assigns to each interval, s, a distinct rank, p(s)∊ [1, 2,…,n]. We say that s can see t if p(s)<p(t) and there is a point p∊s∩t so that p∉u for all u with p(s)<p(u)<p(t). It is shown that a ranking can be found in time O(n log n) such that each interval sees at most three other intervals. It is also shown that a ranking that minimizes the average number of endpoints visible from an interval can be computed in time O(n 5/2). The results have applications to intersection problems for intervals, as well as to channel routing problems which arise in layouts of VLSI circuits.},
  author       = {Edelsbrunner, Herbert and Overmars, Mark and Welzl, Emo and Hartman, Irith and Feldman, Jack},
  issn         = {1029-0265},
  journal      = {International Journal of Computer Mathematics},
  number       = {3-4},
  pages        = {129 -- 144},
  publisher    = {Taylor & Francis},
  title        = {{Ranking intervals under visibility constraints}},
  doi          = {10.1080/00207169008803871},
  volume       = {34},
  year         = {1990},
}

@article{4126,
  abstract     = {Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data structure is developed which is efficient in time and space and allows us to report all d-dimensional rectangles stored which intersect a d-dimensional query rectangle. Second, in Part II, a slightly modified version of this new data structure is applied to report all intersecting pairs of rectangles of a given set. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions.},
  author       = {Edelsbrunner, Herbert},
  issn         = {1029-0265},
  journal      = {International Journal of Computer Mathematics},
  number       = {3-4},
  pages        = {209 -- 219},
  publisher    = {Taylor & Francis},
  title        = {{A new approach to rectangle intersections part 1}},
  doi          = {10.1080/00207168308803364},
  volume       = {13},
  year         = {1983},
}

@article{4127,
  abstract     = {The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions.},
  author       = {Edelsbrunner, Herbert},
  issn         = {1029-0265},
  journal      = {International Journal of Computer Mathematics},
  number       = {3-4},
  pages        = {221 -- 229},
  publisher    = {Taylor & Francis},
  title        = {{A new approach to rectangle intersections part 2}},
  doi          = {10.1080/00207168308803365},
  volume       = {13},
  year         = {1983},
}