We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous appli...
Joe D. Warren, Scott Schaefer, Anil N. Hirani, Mat...
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same...
Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Na...