Skip to main content

Geometric containment is not reducible to Pareto dominance

  • Conference paper
  • First Online:
Book cover STACS 85 (STACS 1985)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Edelsbrunner, H. and Overmars M.H.: "On the equivalence of some rectangle problems". Tech. Rep. F77, Institut fur Informationsverarbeitung, University of Gzaz, 1981.

    Google Scholar 

  2. Lefschetz S., "Introduction to Topology", Princeton University Press, Princeton, N.J., 1949.

    Google Scholar 

  3. Sack J.R., Santoro, N., and Urrutia, J.: "Containment of Elementary Geometric Objects", Proc. South-Eastern Conf. on Combinatorics, Graph Theory and Computing, Baton Rouge, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Santoro, N., Sidney, J.B., Sidney, S.J., Urrutia, J.B. (1984). Geometric containment is not reducible to Pareto dominance. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024020

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13912-6

  • Online ISBN: 978-3-540-39136-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics