Guarding galleries where every point sees a large area
暂无分享,去创建一个
[1] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[2] Norbert Sauer,et al. On the Density of Families of Sets , 1972, J. Comb. Theory A.
[3] S. Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. , 1972 .
[4] J. Eckhoff. Über kombinatorisch-geometrische Eigenschaften von Komplexen und Familien konvexer Mengen. , 1980 .
[5] Jaroslav Nešetřil,et al. Simple proof of the existence of restricted ramsey graphs by means of a partite construction , 1981, Comb..
[6] P. Assouad. Densité et dimension , 1983 .
[7] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[8] Derek G. Corneil,et al. Visibility graph recognition , 1990 .
[9] P. Shiu,et al. Geometric and analytic number theory , 1991 .
[10] N. Alon,et al. Piercing convex sets and the hadwiger-debrunner (p , 1992 .
[11] Joseph O'Rourke. Computational geometry column 18 , 1993, Int. J. Comput. Geom. Appl..
[12] Lydia E. Kavraki,et al. Randomized query processing in robot path planning , 1995, STOC '95.
[13] P. Valtr. Guarding galleries where no point sees a small area , 1998 .