Advertisement

How to search in history

  • Bernard Chazelle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)

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(log2 n) time which of n given points in E3 is closest to an arbitrary query point.

Keywords

Internal Node Voronoi Diagram Binary Search Total Order Query Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BO]
    Bentley, J.L., Ottmann, T. Algorithms for reporting and counting geometric intersections, IEEE Trans. Comp., vol. C-28, pp. 643–647, 1979.Google Scholar
  2. [DL]
    Dobkin, D.P., Lipton, R.J. Multidimensional searching problems, SIAM Journal on Computing, 5, pp. 181–186, 1976.Google Scholar
  3. [DM]
    Dobkin, D.P., Munro, J.I. Efficient uses of the past, Proc. 21st Annual FOCS Symp., pp. 200–206, 1980.Google Scholar
  4. [F]
    Fuchs, H., Kedem, Z.M., Naylor, B. On visible surface generation by a priori tree structures, Computer Graphics, 14, pp. 124–133, 1980.Google Scholar
  5. [K]
    Kirkpatrick, D.G. Optimal search in planar subdivisions, University of British Columb Tech. Report 81–13, 1981.Google Scholar
  6. [LP]
    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.CrossRefGoogle Scholar
  7. [LiP]
    Lipsky, W., Preparata, F.P. Segments, rectangles, contours, J. Algorithms, 2, pp. 63–76, 1981.Google Scholar
  8. [LT]
    Lipton, R.J., Tarjan, R.E. Applications of a planar separator theorem, Proc. 18th. Annual FOCS Symp., pp.162–170, 1977.Google Scholar
  9. [O]
    Overmars, M.H. Searching in the past I, University of Utrecht, The Netherlands Report RUU-CS-81-7, 1981.Google Scholar
  10. [SE]
    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.Google Scholar
  11. [SH]
    Shamos, M.I. Geometric complexity, Proc. 7th ACM SIGACT Symposium, 1975, pp. 224–233.Google Scholar
  12. [W]
    Willard, D.E. New data structures for orthogonal queries, To appear in SIAM J. Comp.Google Scholar
  13. [Y]
    Yao, A.C. On the preprocessing cost in multidimensional search, IBM San Jose Research Center, Tech. Rep., to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Bernard Chazelle
    • 1
  1. 1.Computer Science DepartmentBrown UniversityProvidence

Personalised recommendations