论文信息 - A short proof of an interesting helly-type theorem - 字舞流文

A short proof of an interesting helly-type theorem

We give a short proof of the theorem that any family of subsets ofRd, with the property that the intersection of any nonempty finite subfamily can be represented as the disjoint union of at mostk closed convex sets, has Helly number at mostk(d+1).

Nina Amenta | N. Amenta

[1] T. Motzkin,et al. On components in some families of sets , 1961 .

[2] Kenneth L. Clarkson,et al. Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[3] D. Larman. Helly type properties of unions of convex sets , 1968 .

[4] Micha Sharir,et al. A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.

[5] V. Klee,et al. Helly's theorem and its relatives , 1963 .

[6] Micha Sharir,et al. A subexponential bound for linear programming , 1992, SCG '92.

[7] Micha Sharir,et al. A Subexponential Bound for Linear Programming , 1992, Symposium on Computational Geometry.

[8] Raimund Seidel,et al. Linear programming and convex hulls made easy , 1990, SCG '90.