92 search results - page 1 / 19 » On Maximal S-Free Convex Sets |
SIAMDM
2011
13 years 1 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
COMPGEOM
2005
ACM
13 years 8 months ago
2005
ACM
MOR
2010
13 years 1 months ago
2010
SIAMDM
2010
13 years 1 months ago
2010
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
SODA
1996
ACM
13 years 7 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...