Efficient Splitting and Merging Algorithms for Order Decomposable Problems
- 1 October 1999
- journal article
- Published by Elsevier in Information and Computation
- Vol. 154 (1) , 1-33
- https://doi.org/10.1006/inco.1999.2811
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Dynamic algorithms in computational geometryProceedings of the IEEE, 1992
- Maintenance of geometric extremaJournal of the ACM, 1991
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- Batched dynamic solutions to decomposable searching problemsJournal of Algorithms, 1985
- A new approach to rectangle intersections part IInternational Journal of Computer Mathematics, 1983
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Decomposable searching problemsInformation Processing Letters, 1979
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974