Abstract
This paper considers the problem of granting a dynamic data structure the capability of remembering the situation it held at previous times. We present a new scheme for recording a history of h updates over an ordered set S of n objects, which allows fast neighbor computation at any time in the history. This scheme requires O(n + h) space and O(log n log h) query response-time, which saves a factor of log n space over previous structures. Aside from its improved performance, the novelty of our method is to allow the set S to be only partially ordered with respect to queries and the time-measure to be multi-dimensional. The generality of our method makes it useful to a number of problems in three-dimensional geometry. For example, we are able to give fast algorithms for locating a point in a 3d-complex, using linear space, or for finding which of n given points is closest to a query plane. Using a simpler, yet conceptually similar technique, we show that with only O(n2) preprocessing, we can determine in O(log 2 n) time which of n given points in E3 is closest to an arbitrary query point.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bentley, J.L., Ottmann, T. Algorithms for reporting and counting geometric intersections, IEEE Trans. Comp., vol. C-28, pp. 643–647, 1979.
Dobkin, D.P., Lipton, R.J. Multidimensional searching problems, SIAM Journal on Computing, 5, pp. 181–186, 1976.
Dobkin, D.P., Munro, J.I. Efficient uses of the past, Proc. 21st Annual FOCS Symp., pp. 200–206, 1980.
Fuchs, H., Kedem, Z.M., Naylor, B. On visible surface generation by a priori tree structures, Computer Graphics, 14, pp. 124–133, 1980.
Kirkpatrick, D.G. Optimal search in planar subdivisions, University of British Columb Tech. Report 81–13, 1981.
Lee, D.T., Preparata, F.P. Location of a point in a planar subdivision and its applications, SIAM Journal on Computing, 6, pp. 594–606, 1977.
Lipsky, W., Preparata, F.P. Segments, rectangles, contours, J. Algorithms, 2, pp. 63–76, 1981.
Lipton, R.J., Tarjan, R.E. Applications of a planar separator theorem, Proc. 18th. Annual FOCS Symp., pp.162–170, 1977.
Overmars, M.H. Searching in the past I, University of Utrecht, The Netherlands Report RUU-CS-81-7, 1981.
Seidel, R. A convex hull algorithm optimal for point sets in even dimensions, Master's Thesis, Tech. Report 81-14, Univ. British Columbia, Vancouver, Canada, 1981.
Shamos, M.I. Geometric complexity, Proc. 7th ACM SIGACT Symposium, 1975, pp. 224–233.
Willard, D.E. New data structures for orthogonal queries, To appear in SIAM J. Comp.
Yao, A.C. On the preprocessing cost in multidimensional search, IBM San Jose Research Center, Tech. Rep., to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chazelle, B. (1983). How to search in history. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_93
Download citation
DOI: https://doi.org/10.1007/3-540-12689-9_93
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12689-8
Online ISBN: 978-3-540-38682-7
eBook Packages: Springer Book Archive