|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| [[Image:k-sets.svg|thumb|300px|A set of six points (red), its six 2-sets (the sets of points contained in the blue ovals), and lines separating each k-set from the remaining points (dashed black).]]
| | Nestor is the title my mothers and fathers gave me but I don't like when people use my full name. Arizona has always been my living location but my spouse wants us to move. She is currently a cashier but soon she'll be on her own. Playing crochet is some thing that I've done for many years.<br><br>Here is my web page: car warranty ([http://User462.Cp.Isp169.com/?document_srl=148855 her explanation]) |
| In [[discrete geometry]], a ''k''-set of a finite point set ''S'' in the [[Euclidean plane]] is a [[subset]] of ''k'' elements of ''S'' that can be strictly separated from the remaining points by a [[line (geometry)|line]]. More generally, in [[Euclidean space]] of higher dimensions, a ''k''-set of a finite point set is a subset of ''k'' elements that can be separated from the remaining points by a [[hyperplane]]. In particular, when ''k'' = ''n''/2 (where ''n'' is the size of ''S''), the line or hyperplane that separates a ''k''-set from the rest of ''S'' is a '''halving line''' or '''halving plane'''.
| |
| | |
| ''K''-sets are related by [[projective duality]] to ''k''-levels in [[arrangement of lines|line arrangements]]; the ''k''-level in an arrangement of ''n'' lines in the plane is the curve consisting of the points that lie on one of the lines and have exactly ''k'' lines below them. Discrete and computational geometers have also studied levels in arrangements of more general kinds of curves and surfaces.<ref>Agarwal et al. (1997); Chan (2003; 2005a,b).</ref>
| |
| | |
| == Combinatorial bounds ==
| |
| {{unsolved|mathematics|What is the largest possible number of halving lines for a set of n points in the plane?}}
| |
| It is of importance in the analysis of geometric algorithms to bound the number of ''k''-sets of a planar point set,<ref>Chazelle and Preparata (1986); Cole et al. (1987); Edelsbrunner and Welzl (1986).</ref> or equivalently the number of ''k''-levels of a planar line arrangement, a problem first studied by [[László Lovász|Lovász]] (1971) and [[Paul Erdős|Erdős]] et al. (1973). The best known upper bound for this problem is ''O''(''nk''<sup>1/3</sup>), as was shown by Tamal Dey (1998) using the [[Crossing number (graph theory)|crossing number]] inequality of Ajtai, [[Václav Chvátal|Chvátal]], Newborn, and [[Endre Szemerédi|Szemerédi]]. However, the best known lower bound is far from Dey's upper bound: it is Ω(''n'' exp(''c'' (log''k'')<sup>1/2</sup>)) for some constant ''c'', as shown by Toth (2001).
| |
| | |
| In three dimensions, the best upper bound known is ''O''(''nk''<sup>3/2</sup>), and the best lower bound known is Ω(''nk'' exp(''c'' (log''k'')<sup>1/2</sup>)).<ref>Sharir et al. (2001).</ref>
| |
| For points in three dimensions that are in [[convex position]], that is, are the vertices of some convex polytope, the number of k-sets is
| |
| Θ(''(n-k)k''), which follows from arguments used for bounding the complexity of k-th order Voronoi diagrams.<ref>Lee (1982); Clarkson and Shor (1989).</ref>
| |
| | |
| For the case when ''k'' = ''n''/2 (halving lines), the maximum number of combinatorially distinct lines through two points of ''S'' that bisect the remaining points when ''k'' = 1, 2, ... is
| |
| :1,3,6,9,13,18,22... {{OEIS|id=A076523}}.
| |
| | |
| Bounds have also been proven on the number of ≤''k''-sets, where a ≤''k''-set is a ''j''-set for some ''j'' ≤ ''k''. In two dimensions, the maximum number of ≤''k''-sets is exactly ''nk'',<ref>Alon and Győri (1986).</ref> while in ''d'' dimensions the bound is <math>O(n^{\lfloor d/2\rfloor}k^{\lceil d/2\rceil})</math>.<ref>Clarkson and Shor (1989).</ref>
| |
| | |
| == Construction algorithms ==
| |
| Edelsbrunner and Welzl (1986) first studied the problem of constructing all ''k''-sets of an input point set, or dually of constructing the ''k''-level of an arrangement. The ''k''-level version of their algorithm can be viewed as a [[plane sweep]] algorithm that constructs the level in left-to-right order. Viewed in terms of ''k''-sets of point sets, their algorithm maintains a [[dynamic convex hull]] for the points on each side of a separating line, repeatedly finds a [[bitangent]] of these two hulls, and moves each of the two points of tangency to the opposite hull. Chan (1999) surveys subsequent results on this problem, and shows that it can be solved in time proportional to Dey's ''O''(''nk''<sup>1/3</sup>) bound on the complexity of the ''k''-level.
| |
| | |
| Agarwal and [[Jiří Matoušek (mathematician)|Matoušek]] describe algorithms for efficiently constructing an approximate level; that is, a curve that passes between the (''k'' - ''d'')-level and the (''k'' + ''d'')-level for some small approximation parameter ''d''. They show that such an approximation can be found, consisting of a number of line segments that depends only on ''n''/''d'' and not on ''n'' or ''k''.<ref>Agarwal (1990); Matoušek (1990,1991).</ref>
| |
| | |
| == Matroid generalizations ==
| |
| The planar ''k''-level problem can be generalized to one of parametric optimization in a [[matroid]]: one is given a matroid in which each element is weighted by a linear function of a parameter λ, and must find the minimum weight basis of the matroid for each possible value of λ. If one graphs the weight functions as lines in a plane, the ''k''-level of the arrangement of these lines graphs as a function of λ the weight of the largest element in an optimal basis in a [[uniform matroid]], and Dey showed that his ''O''(''nk''<sup>1/3</sup>) bound on the complexity of the ''k''-level could be generalized to count the number of distinct optimal bases of any matroid with ''n'' elements and rank ''k''.
| |
| | |
| For instance, the same ''O''(''nk''<sup>1/3</sup>) upper bound holds for counting the number of different [[minimum spanning tree]]s formed in a graph with ''n'' edges and ''k'' vertices, when the edges have weights that vary linearly with a parameter λ. This parametric minimum spanning tree problem has been studied by various authors and can be used to solve other bicriterion spanning tree optimization problems.<ref>Gusfield (1980); Ishii et al. (1981); Katoh and Ibaraki (1983); Hassin and Tamir (1989); Fernández-Baca et al. (1996); Chan (2005c).</ref>
| |
| | |
| However, the best known lower bound for the parametric minimum spanning tree problem is Ω(''n'' α(''k'')), where α is the [[inverse Ackermann function]], an even weaker bound than that for the ''k''-set problem. For more general matroids, Dey's ''O''(''nk''<sup>1/3</sup>) upper bound has a matching lower bound.<ref>Eppstein (1998).</ref>
| |
| | |
| ==Notes==
| |
| {{reflist}}
| |
| | |
| ==References==
| |
| {{refbegin|colwidth=30em}}
| |
| *{{cite journal
| |
| | last = Agarwal | first = P. K. | authorlink = Pankaj K. Agarwal
| |
| | title = Partitioning arrangements of lines I: An efficient deterministic algorithm
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 5
| |
| | issue = 1
| |
| | year = 1990
| |
| | pages = 449–483
| |
| | doi = 10.1007/BF02187805}}
| |
| *{{cite conference
| |
| | last1 = Agarwal | first1 = P. K. | author1-link = Pankaj K. Agarwal
| |
| | last2 = Aronov | first2 = B. | author2-link = Boris Aronov
| |
| | last3 = Sharir | first3 = M. | author3-link = Micha Sharir
| |
| | title = On levels in arrangements of lines, segments, planes, and triangles
| |
| | booktitle = Proc. 13th Annual Symposium on Computational Geometry
| |
| | year = 1997
| |
| | pages = 30–38}}
| |
| *{{cite journal
| |
| | last1 = Alon | first1 = N. | author1-link = Noga Alon
| |
| | last2 = Győri | first2 = E.
| |
| | title = The number of small semi-spaces of a finite set of points in the plane
| |
| | journal = Journal of Combinatorial Theory, Series A
| |
| | volume = 41
| |
| | pages = 154–157
| |
| | year = 1986
| |
| | doi = 10.1016/0097-3165(86)90122-6}}
| |
| *{{cite journal
| |
| | last = Chan | first = T. M. | authorlink = Timothy M. Chan
| |
| | title = Remarks on k-level algorithms in the plane
| |
| | year = 1999
| |
| | url = http://www.cs.uwaterloo.ca/~tmchan/lev2d_7_7_99.ps.gz}}
| |
| *{{cite journal
| |
| | last = Chan | first = T. M. | authorlink = Timothy M. Chan
| |
| | title = On levels in arrangements of curves
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 29
| |
| | pages = 375–393
| |
| | year = 2003
| |
| | doi = 10.1007/s00454-002-2840-2
| |
| | issue = 3}}
| |
| *{{cite journal
| |
| | last = Chan | first = T. M. | authorlink = Timothy M. Chan
| |
| | title = On levels in arrangements of curves, II: a simple inequality and its consequence
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 34
| |
| | pages = 11–24
| |
| | year = 2005a
| |
| | doi = 10.1007/s00454-005-1165-3}}
| |
| *{{cite conference
| |
| | last = Chan | first = T. M. | authorlink = Timothy M. Chan
| |
| | title = On levels in arrangements of surfaces in three dimensions
| |
| | booktitle = Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms
| |
| | pages = 232–240
| |
| | year = 2005b
| |
| | url = http://www.cs.uwaterloo.ca/~tmchan/surf_soda.ps}}
| |
| *{{cite conference
| |
| | last = Chan | first = T. M. | authorlink = Timothy M. Chan
| |
| | title = Finding the shortest bottleneck edge in a parametric minimum spanning tree
| |
| | booktitle = Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms
| |
| | pages = 232–240
| |
| | year = 2005c
| |
| | url = http://www.cs.uwaterloo.ca/~tmchan/bottle_soda.ps}}
| |
| *{{cite journal
| |
| | last1 = Chazelle | first1 = B. | author1-link = Bernard Chazelle
| |
| | last2 = Preparata | first2 = F. P. | author2-link = Franco Preparata
| |
| | title = Halfspace range search: an algorithmic application of ''k''-sets
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 1
| |
| | issue = 1
| |
| | year = 1986
| |
| | pages = 83–93
| |
| | id = {{MathSciNet | id = 0824110}}
| |
| | doi = 10.1007/BF02187685}}
| |
| *{{cite journal
| |
| | last1 = Clarkson | first1 = K. L. | author1-link = Kenneth L. Clarkson
| |
| | last2 = Shor | first2 = P. | author2-link = Peter Shor
| |
| | title = Applications of random sampling, II
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 4
| |
| | pages = 387–421
| |
| | year = 1989
| |
| | doi = 10.1007/BF02187740}}
| |
| *{{cite journal
| |
| | last1 = Cole | first1 = R.
| |
| | last2 = Sharir | first2 = M. | author2-link = Micha Sharir
| |
| | last3 = Yap | first3 = C. K.
| |
| | title = On ''k''-hulls and related problems
| |
| | journal = [[SIAM Journal on Computing]]
| |
| | volume = 16
| |
| | issue = 1
| |
| | year = 1987
| |
| | pages = 61–77
| |
| | id = {{MathSciNet | id = 0873250}}
| |
| | doi = 10.1137/0216005}}
| |
| *{{cite journal
| |
| | last = Dey | first = T. L.
| |
| | title = Improved bounds for planar ''k''-sets and related problems
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 19
| |
| | issue = 3
| |
| | year = 1998
| |
| | pages = 373–382
| |
| | doi = 10.1007/PL00009354
| |
| | id = {{MathSciNet | id = 1608878}}}}
| |
| *{{cite journal
| |
| | last1 = Edelsbrunner | first1 = H. | author1-link = Herbert Edelsbrunner
| |
| | last2 = Welzl | first2 = E. | author2-link = Emo Welzl
| |
| | title = Constructing belts in two-dimensional arrangements with applications
| |
| | journal = [[SIAM Journal on Computing]]
| |
| | volume = 15
| |
| | issue = 1
| |
| | year = 1986
| |
| | pages = 271–284
| |
| | doi = 10.1137/0215019}}
| |
| *{{cite journal
| |
| | title = Geometric lower bounds for parametric matroid optimization
| |
| | last = Eppstein | first = D. | authorlink = David Eppstein
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 20
| |
| | pages = 463–476
| |
| | year = 1998
| |
| | url = http://www.ics.uci.edu/~eppstein/pubs/Epp-DCG-98.pdf
| |
| | doi = 10.1007/PL00009396
| |
| | issue = 4}}
| |
| *{{cite conference
| |
| | author = [[Paul Erdős|Erdős, P.]]; [[László Lovász|Lovász, L.]]; Simmons, A.; [[Ernst G. Straus|Straus, E. G.]]
| |
| | title = Dissection graphs of planar point sets
| |
| | booktitle = A Survey of Combinatorial Theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971)
| |
| | publisher = North-Holland
| |
| | location = Amsterdam
| |
| | date = 1973
| |
| | pages = 139–149
| |
| | id = {{MathSciNet | id = 0363986}}}}
| |
| *{{cite journal
| |
| | title = Using sparsification for parametric minimum spanning tree problems
| |
| | author = Fernández-Baca, D.; Slutzki, G.; [[David Eppstein|Eppstein, D.]]
| |
| | journal = [[Nordic Journal of Computing]]
| |
| | volume = 3
| |
| | issue = 4
| |
| | pages = 352–366
| |
| | year = 1996}}
| |
| *{{cite paper
| |
| | author = Gusfield, D.
| |
| | title = Sensitivity analysis for combinatorial optimization
| |
| | version = Tech. Rep. UCB/ERL M80/22
| |
| | publisher = University of California, Berkeley
| |
| | date = 1980}}
| |
| *{{cite journal
| |
| | author = Hassin, R.; Tamir, A.
| |
| | title = Maximizing classes of two-parametric objectives over matroids
| |
| | journal = Math. Oper. Res.
| |
| | volume = 14
| |
| | pages = 362–375
| |
| | year = 1989
| |
| | doi = 10.1287/moor.14.2.362
| |
| | issue = 2}}
| |
| *{{cite journal
| |
| | author = Ishii, H.; Shiode, S.; Nishida, T.
| |
| | title = Stochastic spanning tree problem
| |
| | journal = [[Discrete Applied Mathematics]]
| |
| | volume = 3
| |
| | pages = 263–273
| |
| | year = 1981
| |
| | doi = 10.1016/0166-218X(81)90004-4
| |
| | issue = 4}}
| |
| *{{cite paper
| |
| | author = Katoh, N.; Ibaraki, T.
| |
| | title = On the total number of pivots required for certain parametric combinatorial optimization problems
| |
| | version = Working Paper 71
| |
| | publisher = Inst. Econ. Res., Kobe Univ. of Commerce
| |
| | date = 1983}}
| |
| *{{cite journal
| |
| | last = Lee | first = Der-Tsai | authorlink = Der-Tsai Lee
| |
| | title = On k-Nearest Neighbor Voronoi Diagrams in the Plane
| |
| | journal = IEEE Transactions on Computers
| |
| | volume = 31
| |
| | year = 1982
| |
| | pages = 478–487
| |
| | doi = 10.1109/TC.1982.1676031
| |
| | issue = 6}}
| |
| *{{cite journal
| |
| | author = [[László Lovász|Lovász, L.]]
| |
| | title = On the number of halving lines
| |
| | journal = Annales Universitatis Scientiarum Budapestinensis de Rolando Eőtvős Nominatae Sectio Mathematica
| |
| | volume = 14
| |
| | year = 1971
| |
| | pages = 107–108}}
| |
| *{{cite journal
| |
| | last = Matoušek | first = J. | authorlink = Jiří Matoušek (mathematician)
| |
| | title = Construction of ε-nets
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 5
| |
| | issue = 5
| |
| | year = 1990
| |
| | pages = 427–448
| |
| | id = {{MathSciNet | id = 1064574}}
| |
| | doi = 10.1007/BF02187804}}
| |
| *{{cite journal
| |
| | last = Matoušek | first = J. | authorlink = Jiří Matoušek (mathematician)
| |
| | title = Approximate levels in line arrangements
| |
| | journal = [[SIAM Journal on Computing]]
| |
| | volume = 20
| |
| | issue = 2
| |
| | pages = 222–227
| |
| | year = 1991
| |
| | doi = 10.1137/0220013}}
| |
| *{{cite journal
| |
| | author = [[Micha Sharir|Sharir, M.]]; Smorodinsky, S.; Tardos, G.
| |
| | title = An improved bound for ''k''-sets in three dimensions
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 26
| |
| | year = 2001
| |
| | pages = 195–204
| |
| | doi = 10.1007/s00454-001-0005-3}}
| |
| *{{cite journal
| |
| | author = Tóth, G.
| |
| | title = Point sets with many ''k''-sets
| |
| | journal = [[Discrete and Computational Geometry]]
| |
| | volume = 26
| |
| | issue = 2
| |
| | pages = 187–194
| |
| | year = 2001
| |
| | doi = 10.1007/s004540010022}}
| |
| {{refend}}
| |
| | |
| ==External links==
| |
| *[http://compgeom.cs.uiuc.edu/~jeffe/open/ksets.html Halving lines and k-sets], Jeff Erickson
| |
| *[http://maven.smith.edu/~orourke/TOPP/P7.html The Open Problems Project, Problem 7: ''k''-sets]
| |
| | |
| [[Category:Discrete geometry]]
| |
| [[Category:Matroid theory]]
| |