首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Balanced partitions of two sets of points in the plane
Authors:Atsushi Kaneko  M Kano  
Institution:

a Department of Computer Science and Communication Engineering, Kogakuin University, Shinjuku-ku, Tokyo 163-8677, Japan

b Department of Computer and Information Sciences, Ibaraki University, Hitachi, 316-8511, Japan

Abstract:We prove the following theorem. Let m≥2 and q≥1 be integers and let S and T be two disjoint sets of points in the plane such that no three points of Sunion or logical sumT are on the same line, |S|=2q and |T|=mq. Then Sunion or logical sumT can be partitioned into q disjoint subsets P1,P2,…,Pq satisfying the following two conditions: (i) conv(Pi)∩conv(Pj)=φ for all 1≤i<jq, where conv(Pi) denotes the convex hull of Pi; and (ii) |PiS|=2 and |PiT|=m for all 1≤iq.
Keywords:Balanced partition  Point set  Plane
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号