Skip to main content
SpringerLink
Log in

Efficient spatial point location

Extended abstract

  • Conference paper
  • First Online:
Book cover Algorithms and Data Structures (WADS 1989)

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

Included in the following conference series:

Work supported in part by Cadre Technologies, Inc., and by the Joint Services Electronics Program under Contract N00014-84-C-0149

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7 References

  1. B. Chazelle, “How to Search in History,” Information and Control 64 (1985), 77–99.

    Article  Google Scholar 

  2. B. Chazelle & J. Friedman, “A Deterministic View of Random Sampling and its use in Geometry,” Proc. 29th IEEE Symp. on Foundations of Computer Science (1988), 539–548.

    Google Scholar 

  3. B. Chazelle & L.J. Guibas, “Fractional Cascading: I. A Data Structuring Technique,” Algorithmica 1 (1986), 133–162.

    MathSciNet  Google Scholar 

  4. K.L. Clarkson, “New Applications of Random Sampling in Computational Geometry,” Discrete & Computational Geometry 2 (1987), 195–222.

    Google Scholar 

  5. R. Cole, “Searching and Storing Similar Lists,” J. of Algorithms 7 (1986), 202–220.

    Article  Google Scholar 

  6. J.R. Driscoll, N. Sarnak, D.D. Sleator & R.E. Tarjan, “Making Data Structures Persistent,” J. Computer and System Sciences 38 (1989), 86–124.

    Google Scholar 

  7. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.

    Google Scholar 

  8. L.J. Guibas & R. Sedgewick, “A Dichromatic Framework for Balanced Trees,” Proc. 19th IEEE Symp. on Foundations of Computer Science (1978), 8–21.

    Google Scholar 

  9. D. Kelly & I. Rival, “Planar Lattices,” Canadian J. Mathematics 27 (1975), 636–665.

    Google Scholar 

  10. D.T. Lee & F.P. Preparata, “Location of a Point in a Planar Subdivision and its Applications,” SIAM J. Computing 6 (1977), 594–606.

    Google Scholar 

  11. A. Lempel, S. Even & I. Cederbaum, “An Algorithm for Planarity Testing of Graphs,” Theory of Graphs, Int. Symposium (1966), 215–232.

    Google Scholar 

  12. F.P. Preparata & M.I. Shamos, Computational Geometry, Springer-Verlag, New York, 1985.

    Google Scholar 

  13. F.P. Preparata & R. Tamassia, “Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures,” Proc. 29th IEEE Symp. on Foundations of Computer Science (1988), 558–567.

    Google Scholar 

  14. F.P. Preparata & R. Tamassia, “Fully Dynamic Point Location in a Monotone Subdivision,” SIAM J. Computing 18 (1989, to appear).

    Google Scholar 

  15. N. Sarnak & R.E. Tarjan, “Planar Point Location Using Persistent Search Trees,” Communications ACM 29 (1986), 669–679.

    Google Scholar 

  16. R. Tamassia & F.P. Preparata, “Dynamic Maintenance of Planar Digraphs, with Applications,” Algorithmica (1989, to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Coordinated Science Lab., University of Illinois, 1101 W. Springfield Ave., 61801, Urbana, Ill.

    Franco P. Preparata

  2. Dept. of Computer Science, Brown University, Box 1910, 02912, Providence, R. I.

    Roberto Tamassia

Authors
  1. Franco P. Preparata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Tamassia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Dehne J. -R. Sack N. Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Preparata, F.P., Tamassia, R. (1989). Efficient spatial point location. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-51542-9_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51542-5

  • Online ISBN: 978-3-540-48237-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation