Rectilinear line segment intersection, layered segment trees, and dynamization☆
References (20)
Decomposable searching problems
Inform. Process. Lett.
(1979)- et al.
Decomposable searching problems. I. Static-to-dynamic transformation
J. Algor.
(1980) - et al.
Dynamization of decomposable searching problems
Inform. Process. Lett.
(1980) - et al.
Space and time optimal algorithms for a class of rectangle intersection problems
Inform. Sci.
(1980) Solutions to Klee's rectangle problems
(1977)- et al.
Data structures for range searching
Comput. Surveys
(1979) - et al.
Efficient worst-case data structures for range searching
Acta Inform.
(1980) - et al.
Algorithms for reporting and counting geometric intersections
IEEE Trans. Comput.
(1979) - et al.
An optimal worst-case algorithm for reporting intersections of rectangles
IEEE Trans. Comput.
(1980) Optimizing the Dynamization of Decomposable Searching Problems
TU Graz, IIG Report 35
(1979)
There are more references available in the full text version of this article.
Cited by (51)
A simple and space efficient segment tree implementation
2019, MethodsXEnhanced layered segment trees: A pragmatic data structure for real-time processing of geometric objects
2002, Pattern RecognitionCitation Excerpt :The process is similar for vρ. For the augmented segment tree, the layered tree structure can be obtained by carrying out a pre-order traversal of T [16]. On visiting each node u, find the vλ (resp.
Further results on generalized intersection searching problems: Counting, reporting, and dynamization
1995, Journal of AlgorithmsThe range co-minima problem
1994, Information Processing LettersOn the optimal binary plane partition for sets of isothetic rectangles
1992, Information Processing LettersEfficient dynamic algorithms for some geometric intersection problems
1990, Information Processing Letters
- ☆
Work carried out under a Natural Sciences and Engineering Research Council of Canada Grant A-7700, while the first author was a postdoctoral fellow at McMaster University.
- †
From July 1st 1982: Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada.
Copyright © 1982 Published by Elsevier Inc.