On the intersection of Orthogonal objects

https://doi.org/10.1016/0020-0190(81)90053-3Get rights and content

First page preview

First page preview
Click to open first page preview
View PDF

References (21)

  • V.K. Vaishnavi et al.

    Space and time optimal algorithms for a class of rectangle intersection problems

    Inform. Sci.

    (1980)
  • J.L. Bentley

    Multidimensional divide-and-conquer

    Comm. ACM

    (1980)
  • J.L. Bentley et al.

    Data structures for range searching

    ACM Comput. Surveys

    (1979)
  • J.L. Bentley et al.

    Efficient worst-case data structures for range searching

    Acta Inform.

    (1980)
  • J.L. Bentley et al.

    Algorithms for reporting and counting geometric intersections

    IEEE Trans. Comput.

    (1979)
  • J.L. Bentley et al.

    An optimal worst-case algorithm for reporting intersections on rectangles

    IEEE Trans. Comput.

    (1980)
  • H. Edelsbrunner

    A new approach to rectangle intersections

  • H. Edelsbrunner

    Dynamic data structures for orthogonal intersectionqueries

    (1980)
  • H. Edelsbrunner et al.

    Multidimensional algorithms and data structures (Bibliography)

    Bull. EATCS

    (1980)
  • H. Edelsbrunner et al.

    Supplement to `Multidimensional algorithms and data structures (Bibliography)'

    Bull. EATCS

    (1981)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1981 Published by Elsevier B.V.