On the number of halving planes

On the number of halving planes
复制标题

关于减半平面的数量

DOI:
--
复制
发表时间:
1989
期刊:
SCG '89
影响因子:
--
通讯作者:
L. Lovász
L. Lovász
中科院分区:
--
文献类型:
--
作者:
I. Bárány;Z. Füredi;L. Lovász

文献摘要

被引文献

相似文献

设S轴3处于一般位置。一个包含三个点的平面被称为二等分平面,如果它将S分成基数相等的两部分。证明了二等分平面的个数至多为O(n2.998),作为主要工具,对平面上的任意n个点的集合Y,构造了一个大小为O(n4)的集合N,使得N中的点几乎均匀地分布在由Y确定的三角形中.
LetS ⊂ℝ3 be ann-set in general position. A plane containing three of the points is called a halving plane if it dissectsS into two parts of equal cardinality. It is proved that the number of halving planes is at mostO(n2.998).As a main tool, for every setY ofn points in the plane a setN of sizeO(n4) is constructed such that the points ofN are distributed almost evenly in the triangles determined byY.