Skip to main content
SpringerLink
Log in

An optimal construction method for generalized convex layers

  • Conference paper
  • First Online:
ISA'91 Algorithms (ISA 1991)

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

Included in the following conference series:

  • 171 Accesses

This author was supported by the ESPRIT II Basic Research Actions Program, under contract No. 3075 (project ALCOM).

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.

References

  1. A. Aggarwal, M. Hansen and T. Leighton. Solving Query-Retrieval Problems by Compacting Voronoi Diagrams. PROC. OF THE 16TH STOC (1990), pp. 331–340.

    Google Scholar 

  2. B. Chazelle. Filtering Search: A New Approach to Query-Answering. SIAM J. OF COMP. vol. 15 (1986), pp. 703–724.

    Google Scholar 

  3. B. Chazelle. On the Convex Layers of a Planar Set. IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 31, no. 4 (1985), pp. 509–517.

    Google Scholar 

  4. B. Chazelle, R. Cole, F.P. Preparata and C. Yap. New Upper Bounds for Neighbor Searching. INFORMATION AND CONTROL, vol. 68 (1986), pp. 105–124.

    Google Scholar 

  5. B. Chazelle and H. Edelsbrunner. Optimal Solutions for a Class of Point Retrieval Problems. J. SYMBOLIC COMPUTATION, vol. 1 (1985), pp. 47–56.

    Google Scholar 

  6. R. Klein, O. Nurmi, T. Ottmann and D. Wood. A Dynamic Fixed Windowing Problem. ALGORITHMICA, vol. 4 (1989), pp. 535–550.

    Google Scholar 

  7. M.H. Overmars and J. van Leeuwen. Maintenance of Configurations in the Plane. J. COMPUT. SYST. SCI. vol. 23 (1981), pp. 166–204.

    Google Scholar 

  8. F.P. Preparata and M.I. Shamos. Computational Geometry: an Introduction. Springer-Verlag New York-Berlin-Heidelberg-Tokyo (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Hans-Peter Lenhof & Michiel Smid

Authors
  1. Hans-Peter Lenhof
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 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

Lenhof, HP., Smid, M. (1991). An optimal construction method for generalized convex layers. 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_79

Download citation

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

  • 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