2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces
暂无分享,去创建一个
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 < j ≤ q; (ii) |P i ∩ S r |= n and |P i ∩ S b | = m for all 1 ≤ i ≤ q. This is a generalization of 2-dimension Ham Sandwich Theorem.
[1] Joseph O'Rourke,et al. Handbook of Discrete and Computational Geometry, Second Edition , 1997 .
[2] Sergey Bereg,et al. Generalizing Ham Sandwich Cuts to Equitable Subdivisions , 1999, SCG '99.
[3] Atsushi Kaneko. A balanced partition of points in the plane and tree embedding problems , 1997, CCCG.