论文信息 - Algorithms for Weak "-nets

Algorithms for Weak "-nets

In the plane, we can nd a weak "-net for convex sets consisting of O(" ?2) points, in time O(n" ?2). We can determine the smallest " for which a given planar set is an "-net in time O(n 3). In IR d , we can nd weak "-nets of size O 1 " d log O(1) 1 " in time O(n (1=") O(1)) (both exponents depending on d).

[1] Jirí Matousek,et al. Linear optimization queries , 1992, SCG '92.

[2] Pankaj K. Agarwal. Geometric Partitioning and its Applications , 1990, Discrete and Computational Geometry.

[3] Jirí Matousek,et al. How to net a lot with little: small ε-nets for disks and halfspaces , 1990, SCG '90.

[4] Jirí Matousek,et al. Reporting Points in Halfspaces , 1992, Comput. Geom..

[5] Noga Alon,et al. Point Selections and Weak ε-Nets for Convex Hulls , 1992, Combinatorics, Probability and Computing.

[6] Jirí Matousek. Construction of ɛ-nets , 1990, Discret. Comput. Geom..

[7] Bernard Chazelle,et al. On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.

[8] David Haussler,et al. Epsilon-nets and simplex range queries , 1986, SCG '86.

[9] Jirí Matousek,et al. Cutting hyperplane arrangements , 1990, SCG '90.

[10] Jirí Matousek,et al. Approximations and optimal geometric divide-and-conquer , 1991, STOC '91.

[11] Leonidas J. Guibas,et al. Improved bounds on weak ε-nets for convex sets , 1993, STOC.

[12] Jirí Matousek,et al. Spanning trees with low crossing number , 1991, RAIRO Theor. Informatics Appl..