On Separating Points by Lines
暂无分享,去创建一个
[1] Pankaj K. Agarwal,et al. Near-Linear Algorithms for Geometric Hitting Sets and Set Covers , 2014, Discrete & Computational Geometry.
[2] Michael T. Goodrich,et al. Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..
[3] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[4] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[5] Micha Sharir,et al. On Range Searching with Semialgebraic Sets II , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[6] Sariel Har-Peled. On the Expected Complexity of Random Convex Hulls , 2011, ArXiv.
[7] Sariel Har-Peled,et al. Peeling the Grid , 2013, SIAM J. Discret. Math..
[8] Geoffrey E. Hinton,et al. Reducing the Dimensionality of Data with Neural Networks , 2006, Science.
[9] Jihui Zhao,et al. Generalized Ham-Sandwich Cuts , 2010, Discret. Comput. Geom..
[10] Sándor P. Fekete,et al. On Simple Polygonalizations with Optimal Area , 2000, Discret. Comput. Geom..
[11] Olivier Devillers,et al. Separating several point sets in the plane , 2001, CCCG.
[12] Ketan Dalal,et al. Counting the onion , 2004, Random Struct. Algorithms.
[13] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .
[14] Joseph S. B. Mitchell,et al. On the Complexity of Shattering Using Arrangements , 1991 .
[15] David G. Kirkpatrick,et al. A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.
[16] Tetsuo Asano,et al. Shattering a set of objects in 2d , 1999, CCCG.
[17] Bernard Chazelle,et al. Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..
[18] Micha Sharir,et al. Near-Linear Approximation Algorithms for Geometric Hitting Sets , 2009, Algorithmica.
[19] Peng-Jun Wan,et al. Separating points by axis-parallel lines , 2005, CCCG.
[20] Bernard Chazelle,et al. A deterministic view of random sampling and its use in geometry , 1990, Comb..
[21] Jirí Matousek,et al. Computing Many Faces in Arrangements of Lines and Segments , 1998, SIAM J. Comput..
[22] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[23] Sariel Har-Peled,et al. On Separating Points by Lines , 2017, Discrete & Computational Geometry.
[24] Jirí Matousek,et al. Efficient partition trees , 1991, SCG '91.
[25] Sariel Har-Peled. Geometric Approximation Algorithms , 2011 .
[26] Kenneth L. Clarkson,et al. Algorithms for Polytope Covering and Approximation , 1993, WADS.
[27] I. Bárány,et al. Longest convex chains , 2009, Random Struct. Algorithms.