| advertise add site services publishers database health videos | ![]() | about toolbar stats live show health store more stuff JOIN/LOGIN |
In geometry, Radon's theorem on convex sets, named after Johann Radon, states that any set of d + 2 points in Rd can be partitioned into two (disjoint) sets whose convex hulls intersect. A point in the intersection of these hulls is called a Radon point of the set. For example, in the case d = 2, the set, call it X, would consist of four points. Depending on the set, it might be possible to partition X, into a triple and a singleton, where the convex hull of the triple (a triangle) contains the singleton, or it would be possible to partition X, into two pairs of points such that the line segments with these points as endpoints intersect. The latter situation would be the case if X, consists of the vertices of a convex quadrilateral, or if the four points are collinear.
[edit] ProofThe proof of Radon's theorem is not too difficult. Suppose is satisfied. Fix some nonzero solution It is clear that this point is in the convex hull of X1 and it is an easy consequence of the above equations satisfied by [edit] Tverberg's theoremA generalisation for partition into r sets was given in 1966 by Helge Tverberg. It states that for
points in Euclidean d-space, there is a partition into r subsets (Tverberg partition) having convex hulls intersecting in at least one common point. [edit] See also[edit] References
|
| ↑ top of page ↑ | about thumbshots |