Skip to main content

2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces

  • Conference paper
Discrete and Computational Geometry (JCDCG 1998)

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

Included in the following conference series:

Abstract

Let m ≥ 2, n ≥ 2 and q ≥ 2 be positive integers. Let S r and S b be two disjoint sets of points in the plane such that no three points of S r S b are collinear, |S r | = nq, and |S b | = mq. This paper shows that Kaneko and Kano’s conjecture is true, i.e., S r S b can be partitioned into q subsets P 1,P 2,...,P q satisfying that: (i) conv(P i ) ∩ conv(P j ) = ∅ for all 1 ≤ i < jq; (ii) |P i S r |= n and |P i S b | = m for all 1 ≤ iq. This is a generalization of 2-dimension Ham Sandwich Theorem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bespamyatnikh, S., Kirkpatrick, D., Snoeyink, J.: Generalizing ham sandwich cuts to equitable subdivision. In: Proceedings of Fifteenth Annual ACM Symposium on Computational Geometry (SoCG 1999), pp. 49–58 (1999)

    Google Scholar 

  2. Goodman, J., O’Rourke, J.: Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  3. Ito, H., Uehara, H., Yokoyama, M.: 2-dimension ham sandwich theorem for partitioning into three convex pieces (Extended abstract). In: Proceedings of Japan Conference on Discrete and Computational Geometry 1998 (Collection of Extended abstracts), December, Tokai Univ., pp. 69–73 (1998)

    Google Scholar 

  4. Kaneko, A., Kano, M.: A balanced partition of points in the plane and tree embedding problems (submitted)

    Google Scholar 

  5. Kaneko, A., Kano, M.: Balanced partition of two sets of points in the plane (submitted)

    Google Scholar 

  6. Sakai, T.: Radial partitions of point sets in R2 (Extended abstract). In: Proceedings of Japan Conference on Discrete and Computational Geometry 1998 (Collection of Extended abstracts), December, Tokai Univ., pp. 74–78 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ito, H., Uehara, H., Yokoyama, M. (2000). 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46515-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67181-7

  • Online ISBN: 978-3-540-46515-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics