Title
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces
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 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.
Year
DOI
Venue
1998
10.1007/978-3-540-46515-7_11
JCDCG
Keywords
Field
DocType
convex pieces,2-dimension ham sandwich theorem,satisfiability
Ham sandwich theorem,Integer,Discrete mathematics,Combinatorics,Disjoint sets,Regular polygon,Problem complexity,Conjecture,Mathematics
Conference
Volume
ISSN
ISBN
1763
0302-9743
3-540-67181-1
Citations 
PageRank 
References 
19
1.94
2
Authors
3
Name
Order
Citations
PageRank
Hiro Ito129039.95
Hideyuki Uehara25412.14
Mitsuo Yokoyama3669.51