论文信息 - Blocking Visibility for Points in General Position

Blocking Visibility for Points in General Position

For a finite set P in the plane, let b(P) be the smallest possible size of a set Q, Q∩P=∅, such that every segment with both endpoints in P contains at least one point of Q. We raise the problem of estimating b(n), the minimum of b(P) over all n-point sets P with no three points collinear. We review results providing bounds on b(n) and mention some additional observations.

Jirí Matousek

[1] Marc Noy,et al. On the chromatic number of some geometric type Kneser graphs , 2005, Comput. Geom..

[2] F. Behrend. On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.

[3] Gert Vegter,et al. In handbook of discrete and computational geometry , 1997 .

[4] Micha Sharir,et al. Abstract. , 2013, Virologie.

[5] J. Pach. Finite point configurations , 1997 .

[6] Joseph O'Rourke,et al. Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[7] Zoltán Füredi,et al. The grid revisted , 1993, Discret. Math..

[8] David R. Wood,et al. On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane , 2005, Discret. Comput. Geom..

[9] Michael Rubinstein,et al. The Number of Intersection Points Made by the Diagonals of a Regular Polygon , 1995, SIAM J. Discret. Math..

[10] Alexandr V. Kostochka,et al. Covering and coloring polygon-circle graphs , 1997, Discret. Math..

[11] Endre Szemerédi,et al. A statistical theorem of set addition , 1994, Comb..

[12] János Pach,et al. Midpoints of segments induced by a point set , 2003 .

[13] Zoltán Füredi,et al. Midpoints of Diagonals of Convex n-GONS , 1991, SIAM J. Discret. Math..