Abstract
In this paper a variant of a segment tree is devised on which, in addition to insertions, deletions and stabbing queries, the operations concatenate and split can be performed efficiently. Insertions, concatenations and splits take O(log n) time, deletions take O(log2 n) time, stabbing queries take O(k + log n) time (where k is the number of answers to the query), and the structure uses O(n log n) space to store. The technique is based on a new general data structure that stores sets of objects, the union-copy structure, on which the operations union (of two sets), copy (of a set), insert (of an object in one or more sets), delete (of an object from all sets in which it occurs) and enumerate (of a set) can be performed efficiently.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, Mass., 1974.
Bentley, J.L., Decomposable searching problems, Inform. Proc. Lett. 8 (1979), pp. 244–251.
Bentley, J.L., and D. Wood, An optimal algorithm for reporting intersections of rectangles, IEEE Trans. on Computers C-29 (1980), pp. 571–577.
Edelsbrunner, H., Dynamic data structures for orthogonal intersection queries, Rep. F59, Tech. Univ. Graz, Institute für Informationsverarbeitung, 1980.
Halperin, D., and M. Sharir, private communication.
Mehlhorn, K., Data structures and algorithms 1: sorting and searching, Springer-Verlag, Berlin, 1984.
Mehlhorn, K., Data structures and algorithms 3: multi-dimensional searching and computational geometry, Springer-Verlag, Berlin, 1984.
Overmars, M.H., The design of dynamic data structures, Lect. Notes in Comp. Science Vol. 156, Springer-Verlag, 1983.
Overmars, M.H., and J. van Leeuwen, Dynamic multi-dimensional data structures based on quad-and k-d trees, Acta Inform. 17 (1982), pp. 267–285.
Preparata, F.P., and M.I. Shamos, Computational geometry, an introduction, Springer-Verlag, New York, 1985.
van Kreveld, M.J., and M.H. Overmars, Divided k-d trees, Techn. Rep. RUU-CS-88-28, Dept. of Computer Science, University of Utrecht, 1988.
van Kreveld, M.J., and M.H. Overmars, Concatenable structures for decomposable searching problems, Techn. Rep., Dept. of Computer Science, University of Utrecht, 1988, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Kreveld, M.J., Overmars, M.H. (1989). Concatenable segment trees. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029010
Download citation
DOI: https://doi.org/10.1007/BFb0029010
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50840-3
Online ISBN: 978-3-540-46098-5
eBook Packages: Springer Book Archive