Computing the connected components of simple rectilinear geometrical objects in $d$-space
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984) no. 2, pp. 171-183.
@article{ITA_1984__18_2_171_0,
author = {Edelsbrunner, Herbert and Van Leeuwen, Jan and Ottmann, Thomas and Wood, Derick},
title = {Computing the connected components of simple rectilinear geometrical objects in $d$-space},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {171--183},
publisher = {EDP-Sciences},
volume = {18},
number = {2},
year = {1984},
mrnumber = {761516},
language = {en},
url = {http://www.numdam.org/item/ITA_1984__18_2_171_0/}
}
TY  - JOUR
AU  - Edelsbrunner, Herbert
AU  - Van Leeuwen, Jan
AU  - Ottmann, Thomas
AU  - Wood, Derick
TI  - Computing the connected components of simple rectilinear geometrical objects in $d$-space
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1984
DA  - 1984///
SP  - 171
EP  - 183
VL  - 18
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1984__18_2_171_0/
UR  - https://www.ams.org/mathscinet-getitem?mr=761516
LA  - en
ID  - ITA_1984__18_2_171_0
ER  -
Edelsbrunner, Herbert; Van Leeuwen, Jan; Ottmann, Thomas; Wood, Derick. Computing the connected components of simple rectilinear geometrical objects in $d$-space. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984) no. 2, pp. 171-183. http://www.numdam.org/item/ITA_1984__18_2_171_0/

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Co., Inc., Reading, Mass., 1974. | MR 413592 | Zbl 0326.68005

2. D. Dobkin, and R. Lipton, On the Complexity of Computations under Varying Sets of Primitives, Journal of Computer and System Sciences 18, 1979, pp. 86-91. | MR 525832 | Zbl 0409.68023

3. H. Edelsbrunner, Dynamic Data Structures for Orthogonal Intersection Queries, Technical University Graz, Institut für Informationsverarbeitung Report 59, 1980.

4. H. Edelsbrunner, Reporting Intersections of Geometric Objects by Means of Covering Rectangles, Bulletin of the E.A.T.C.S., 1980.

5. H. Edelsbrunner, and H. A. Maurer, On the Intersection of Orthogonal Objects, Information Processing Letters 13, 1981, pp. 177-181. | MR 651468

6. G. H. Gonnet, J. I. Munro, and D. Wood, Direct Dynamic Data Structures for Some Line Segment Problems, Computer Graphics and Image Processing, 1983, pp. | Zbl 0585.68065

7. R. H. Güting, and D. Wood, The Parenthesis Tree, Information Sciences 27, 1982, pp. 151-162. | MR 678038 | Zbl 0498.68039

8. H. Imai, and T. Asano, Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane, Technical Report, University of Tokyo, 1981.

9. E. M. Mccreight, Priority Search Trees, Xerox Palo Alto Research Centers Report CSL-81-5, 1982.

10. J. Nievergelt, and F. P. Preparata, Plane-Sweep Algorithms for Intersecting Geometric Figures, Communications of the A.C.M. 25, 1982, pp. 739-747. | Zbl 0491.68075

11. M. H. Overmars, and J. Van Leeuwen, Worst Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems, Information Processing Letters 12, 1981, pp. 168-173. | MR 606295 | Zbl 0459.68026

12. M. I. Shamos, and D. Hoey, Geometric Intersection Problems, Proceedings of the 17th Annual I.E.E.E. F.O.C.S. Symposium, 1976, pp. 208-215. | MR 455532

13. H.-W. Six, and D. Wood, Counting and Reporting Intersections of d-Ranges, I.E.E.E. Transactions on Computers C-31, 1982, pp. 181-18. | MR 648370 | Zbl 0477.68072