Name
Abstract | ||
|---|---|---|
Two elements are separated by a set S, if S contains exactly one of them. We prove that any set of n points in general position in the plane can be separated by O(nloglogn/logn) convex sets, and for some point sets @W(n/logn) convex sets are necessary. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.comgeo.2013.06.001 | Comput. Geom. |
Keywords | Field | DocType |
n point,general position,point set,convex set,separating family,erdős szekeres theorem | Discrete mathematics,Absolutely convex set,Combinatorics,Disjoint sets,Convex combination,Radon's theorem,Convex hull,Convex set,Subderivative,Mathematics,Convex analysis | Journal |
Volume | Issue | ISSN |
46 | 9 | 0925-7721 |
Citations | PageRank | References |
2 | 0.46 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel Gerbner | 1 | 46 | 21.61 |
| Géza Tóth | 2 | 581 | 55.60 |