Skip to main content
SpringerLink
Log in

Orders, k-sets and fast halfplane search on paged memory

  • Contributed Papers
  • Conference paper
  • First Online:
Orders, Algorithms, and Applications (ORDAL 1994)

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

Included in the following conference series:

Abstract

We investigate the properties of the poset defined by the set inclusion relation on the set of possible answers to an halfplane search problem. We use these properties to design a static data structure for n points stored in pages of size b requiring O(n√n/b) worst case pages that reports a solution of size k by accessing O(logb n log log n + k/b) pages.

This is the first sub-quadratic data structure for secondary storage with output sensitive (in the total number of accessed pages) query time, and exploits an original point clustering technique.

Work partially supported by the ESPRIT II Basic Research Action Program of the European Community under contracts No.6881 “Algorithms, Models, User and Service Interfaces for Geography” and No.7141 “Algorithms and Complexity II”

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. Agarwal, P.K., Eppstein, D., Matoušek, J.: Dynamic half-space reporting, geometric optimization, and minimum spanning trees. Proc. 33rd Annu. IEEE Sympos. on Found. Comput. Sci. (1992) 80–89

    Google Scholar 

  2. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983

    Google Scholar 

  3. Brönnimann, H., Chazelle, B., Pach, J.: How hard is half-space reporting. Discrete & Comput. Geom. 10 (1993) 143–155

    Google Scholar 

  4. Chazelle, B., Guibas, L.J., Lee, D.T.: The power of geometric duality. BIT 25 (1985) 76–90

    Google Scholar 

  5. Chazelle, B.: Filtering search: a new approach to query-answering. SIAM J. on Comput. 15 (1986) 703–724

    Google Scholar 

  6. Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete & Comput. Geom. 4 (1989) 387–421

    Google Scholar 

  7. Dushnik, B., Miller, E.W.: Partially ordered sets. American Journal of Mathematics 93 (1941) 600–610

    Google Scholar 

  8. Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, West Germany, 1987

    Google Scholar 

  9. Erdős, P., Lovász, L., Simmons, A., Straus, E.: Dissection graphs of planar point sets. In J.N. Srivastava editor, A Survey of Combinatorial Theory, North-Holland, Amsterdam, Netherlands, 1973, 139–154

    Google Scholar 

  10. Fishburn, P.C.: Interval Orders and Interval Graphs. John Wiley & Sons, New York, NY, 1985

    Google Scholar 

  11. Gambosi, G., Nesetril, J., Talamo, M.: On locally presented posets. Theoret. Comput. Sci. 68 (1990)

    Google Scholar 

  12. Giaccio, R., Talamo, M.: A general framework to deal with sets of intervals. In 8th National Conference on Logic Programming (GULP 93) Gizzeria Lido, Italy, 1993

    Google Scholar 

  13. Goodrich, M.T., Tsay, J., Vengroff, D.E., Vitter, J.S.: External-memory computational geometry. Proc. 34th Annu. IEEE Sympos. on Found. Comput. Sci. (1993) 714–723

    Google Scholar 

  14. Habib, M., Kelly, D., Möhring, R.H.: Comparability invariance of geometric notion of order dimension. Technical Report 320/1992, Technical University of Berlin, Berlin, Germany, 1992

    Google Scholar 

  15. Matoušek, J.: Reporting points in halfspaces. Comput. Geom. Theory & Appl. 2 (1992) 169–186

    Google Scholar 

  16. Preparata, F.P., Shamos, M.I.: Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985

    Google Scholar 

  17. Pach, J., Steiger, W., Szemerédi, E.: An upper bound on the number of planar k-sets. Discrete & Comput. Geom. 7 (1992) 109–123

    Google Scholar 

  18. Santoro, N., Sidney, J.B., Sidney, S.J., Urrutia, J.: Geometric containment and partial orders. SIAM J. Disc. Math. 2 (1989) 245–254

    Google Scholar 

  19. Urrutia, J.: Partial orders and Euclidean geometry. In I. Rival editor, Algorithms and Order, Kluwer Academic Publishers, 1989, 387–434

    Google Scholar 

  20. Welzl, E.: More on k-sets of finite sets in the plane. Discrete & Comput. Geom. 1 (1986) 95–100

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, University of Rome “La Sapienza”, via Salaria 113, I-00198, Rome, Italy

    Paolo G. Franciosa & Maurizio Talamo

Authors
  1. Paolo G. Franciosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurizio Talamo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Vincent Bouchitté Michel Morvan

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Franciosa, P.G., Talamo, M. (1994). Orders, k-sets and fast halfplane search on paged memory. In: Bouchitté, V., Morvan, M. (eds) Orders, Algorithms, and Applications. ORDAL 1994. Lecture Notes in Computer Science, vol 831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019430

Download citation

  • DOI: https://doi.org/10.1007/BFb0019430

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58274-8

  • Online ISBN: 978-3-540-48597-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation