Relative ε-Approximations in Geometry ∗
暂无分享,去创建一个
[1] Benjamin Graham Office,et al. Random Sampling , 2019, Encyclopedic Dictionary of Archaeology.
[2] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[3] David Haussler,et al. Epsilon-nets and simplex range queries , 1986, SCG '86.
[4] Robert E. Tarjan,et al. Planar Point Location Using Persistent Search Trees a , 1989 .
[5] Jirí Matousek. Construction of epsilon nets , 1989, SCG '89.
[6] Bernard Chazelle,et al. Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..
[7] J. Matou Sek,et al. Computing the center of planar point sets , 1991 .
[8] Jirí Matousek,et al. Reporting Points in Halfspaces , 1992, Comput. Geom..
[9] Emo Welzl,et al. On Spanning Trees with Low Crossing Numbers , 1992, Data Structures and Efficient Algorithms.
[10] Jirí Matousek,et al. Efficient partition trees , 1992, Discret. Comput. Geom..
[11] David Haussler,et al. Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications , 1992, Inf. Comput..
[12] Jirí Matousek,et al. Discrepancy and approximations for bounded VC-dimension , 1993, Comb..
[13] Jirí Matousek,et al. Constructing levels in arrangements and higher order Voronoi diagrams , 1994, SCG '94.
[14] János Pach,et al. Combinatorial Geometry , 2012 .
[15] Gert Vegter,et al. In handbook of discrete and computational geometry , 1997 .
[16] Edith Cohen,et al. Size-Estimation Framework with Applications to Transitive Closure and Reachability , 1997, J. Comput. Syst. Sci..
[17] Bernard Chazelle,et al. The discrepancy method - randomness and complexity , 2000 .
[18] Timothy M. Chan. Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions , 2000, SIAM J. Comput..
[19] Yi Li,et al. Improved bounds on the sample complexity of learning , 2000, SODA '00.
[20] J. Matousek,et al. Using The Borsuk-Ulam Theorem , 2007 .
[21] Bernard Chazelle,et al. The discrepancy method in computational geometry , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[22] Edith Cohen,et al. Spatially-decaying aggregation over a network: model and algorithms , 2004, SIGMOD '04.
[23] Boris Aronov,et al. On approximating the depth and related problems , 2005, SODA '05.
[24] Micha Sharir,et al. Ray shooting amid balls, farthest point from a line, and range emptiness searching , 2005, SODA '05.
[25] Haim Kaplan,et al. Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting , 2006, SODA '06.
[26] J. Matousek,et al. Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry , 2007 .
[27] Sariel Har-Peled. How to get close to the median shape , 2007, Comput. Geom..