ON THE NUMBER OF HALVING PLANES

被引：62

作者：

BARANY, I

FUREDI, Z

LOVASZ, L

机构：

[1] HUNGARIAN ACAD SCI, H-1364 BUDAPEST, HUNGARY

[2] EOTVOS LORAND UNIV, DEPT COMP SCI, H-1088 BUDAPEST, HUNGARY

[3] PRINCETON UNIV, PRINCETON, NJ 08544 USA

来源：

COMBINATORICA | 1990年 / 10卷 / 02期

关键词：

D O I：

10.1007/BF02123008

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let S subset-of R3 be an n-set in general position. A plane containing three of the points is called a halving plane if it dissects S into two parts of equal cardinality. It is proved that the number of halving planes is at most O(n2.998). As a main tool, for every set Y of n points in the plane a set N of size O(n4) is constructed such that the points of N are distributed almost evenly in the triangles determined by Y.

引用

页码：175 / 183

页数：9

共 12 条

[1]

[Anonymous], 1987, EATCS MONOGRAPHS THE

[2] A GENERALIZATION OF CARATHEODORYS THEOREM [J].