Computing the connected components of simple rectilinear geometrical objects in -space
Herbert Edelsbrunner; Jan Van Leeuwen; Thomas Ottmann; Derick Wood
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1984)
- Volume: 18, Issue: 2, page 171-183
- ISSN: 0988-3754
Access Full Article
top
How to cite
topEdelsbrunner, Herbert, et al. "Computing the connected components of simple rectilinear geometrical objects in $d$-space." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 18.2 (1984): 171-183. <http://eudml.org/doc/92205>.
@article{Edelsbrunner1984,
author = {Edelsbrunner, Herbert, Van Leeuwen, Jan, Ottmann, Thomas, Wood, Derick},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {2},
pages = {171-183},
publisher = {EDP-Sciences},
title = {Computing the connected components of simple rectilinear geometrical objects in $d$-space},
url = {http://eudml.org/doc/92205},
volume = {18},
year = {1984},
}
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
PB - EDP-Sciences
VL - 18
IS - 2
SP - 171
EP - 183
LA - eng
UR - http://eudml.org/doc/92205
ER -
References
top- 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. Zbl0326.68005MR413592
- 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. Zbl0409.68023MR525832
- 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. MR651468
- 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. Zbl0585.68065
- 7. R. H. GÜTING, and D. WOOD, The Parenthesis Tree, Information Sciences 27, 1982, pp. 151-162. Zbl0498.68039MR678038
- 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. Zbl0548.68067
- 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. Zbl0491.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. Zbl0459.68026MR606295
- 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. MR455532
- 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. Zbl0477.68072MR648370
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.