论文信息 - Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space

Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space

Let P be a set of n points in R3, not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n - 5 different directions if n is odd and at least 2n - 7 if n is even. The bound for odd n is sharp.

Micha Sharir | János Pach | Rom Pinchasi

[1] George B. Purdy,et al. The Directions Determined by n Points in the Plane , 1979 .

[2] R. Pollack,et al. Allowable Sequences and Order Types in Discrete and Computational Geometry , 1993 .

[3] Robert E. Jamison,et al. Properties of Affinely Regular Polygons , 1998 .

[4] P. Scott. On the Sets of Directions Determined by n Points , 1970 .

[5] Ferenc Wettl,et al. On the nuclei of a pointset of a finite projective plane , 1987 .

[6] Robert E. Jamison,et al. A SURVEY OF THE SLOPE PROBLEM , 1985 .

[7] Raul Cordovil,et al. The directions determined by n points in the plane: a matroidal generalization , 1983, Discret. Math..

[8] Aart Blokhuis,et al. The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space , 2002, Discret. Comput. Geom..

[9] László Rédei. Lacunary Polynomials Over Finite Fields , 1973 .

[10] Peter Ungar,et al. 2N Noncollinear Points Determine at Least 2N Directions , 1982, J. Comb. Theory, Ser. A.

[11] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.