Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms

ISA 1991: ISA'91 Algorithms pp 364–374Cite as

Rectangular point location and the dynamic closest pair problem

  • Conference paper
  • First Online:

  • 165 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 557))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.T. Dickerson and R.S. Drysdale. Enumerating k distances for n points in the plane. Proc. 7-th ACM Symp. on Comp. Geom., 1991, pp. 234–238.

    Google Scholar 

  2. D. Dobkin and S. Suri. Dynamically computing the maxima of decomposable functions, with applications. Proc. 30th Annual FOCS, 1989, pp. 488–493.

    Google Scholar 

  3. H. Edelsbrunner, G. Haring and D. Hilbert. Rectangular point location in d dimensions with applications. The Computer Journal 29 (1986), pp. 76–82.

    Google Scholar 

  4. K. Mehlhorn and S. Näher. Dynamic fractional cascading. Algorithmica 5 (1990), pp. 215–241.

    Google Scholar 

  5. M.H. Overmars. The Design of Dynamic Data Structures. Lecture Notes in Computer Science, Vol. 156, Springer-Verlag, Berlin, 1983.

    Google Scholar 

  6. J.S. Salowe. Shallow interdistance selection and interdistance enumeration. To appear in Proceedings WADS, 1991.

    Google Scholar 

  7. C. Schwarz and M. Smid. An O(n log n log log n) algorithm for the on-line closest pair problem. In preparation.

    Google Scholar 

  8. M. Smid. Algorithms for semi-online updates on decomposable problems. Proc. 2nd Canadian Conf. on Computational Geometry, 1990, pp. 347–350.

    Google Scholar 

  9. M. Smid. Maintaining the minimal distance of a point set in less than linear time. Algorithms Review 2 (1991), pp. 33–44.

    Google Scholar 

  10. M. Smid. Maintaining the minimal distance of a point set in polylogarithmic time (revised version). Report MPI-I-91-103, Max-Planck-Institut für Informatik, Saarbrücken, 1991. See also: Proc. 2nd SODA, 1991, pp. 1–6.

    Google Scholar 

  11. K.J. Supowit. New techniques for some dynamic closest-point and farthest-point problems. Proc. 1st SODA, 1990, pp. 84–90.

    Google Scholar 

  12. P.M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom. 4 (1989), pp. 101–115.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, D-6600, Saarbrücken, Germany

    Michiel Smid

Authors
  1. Michiel Smid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wen-Lian Hsu R. C. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smid, M. (1991). Rectangular point location and the dynamic closest pair problem. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_80

Download citation

  • DOI: https://doi.org/10.1007/3-540-54945-5_80

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54945-1

  • Online ISBN: 978-3-540-46600-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation