Dynamization of order decomposable set problems
- 30 September 1981
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 2 (3), 245-260
- https://doi.org/10.1016/0196-6774(81)90025-0
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Two general methods for dynamizing decomposable searching problemsComputing, 1981
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Finding the intersection of n half-spaces in time O(n log n)Theoretical Computer Science, 1979
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977