Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere
Michael J. Todd · Mathematics of Operations Research · 1981
Call a subset of Rn complete if the origin is in its convex hull. We are concerned with the construction of large finite sets of points on the unit sphere whose complete subsets are, in some sense, easy to describe. Our motivation comes from simplicial algorithms for approximating zeroes of functions. We construct two classes of such subsets of the sphere, both of which generalize a subset that corresponds to usual integer labelling.