The different ways of stabbing disjoint convex sets
暂无分享,去创建一个
A. Liu | Ted Lewis | Meir Katchalski | M. Katchalski | T. Lewis | A. Liu
[1] Ted Lewis,et al. Geometric permutations for convex sets , 1985, Discret. Math..
[2] A. Liu,et al. Geometric permutations and common transversals , 1986, Discret. Comput. Geom..
[3] Helge Tverberg,et al. Proof of grünbaum's conjecture on common transversals for translates , 1989, Discret. Comput. Geom..
[4] V. Klee,et al. Combinatorial Geometry in the Plane , 1964 .
[5] Rephael Wenger,et al. Upper bounds on geometric permutations for convex sets , 1990, Discret. Comput. Geom..
[6] Micha Sharir,et al. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2 , 1990, Discret. Comput. Geom..
[7] A. Liu,et al. Geometric permutations of disjoint translates of convex sets , 1987, Discret. Math..
[8] B. Grünbaum. On common transversals , 1958 .
[9] M. Katchalski. A conjecture of Grünbaum on common transversals. , 1986 .