Integrally-convex set
http://dbpedia.org/resource/Integrally-convex_set
An integrally-convex set is the discrete geometry analogue of the concept of convex set in geometry. A subset X of the integer grid is integrally convex if any point y in the convex hull of X can be expressed as a convex combination of the points of X that are "near" y, where "near" means that the distance between each two coordinates is less than 1.
rdf:langString
rdf:langString
Integrally-convex set
xsd:integer
63326139
xsd:integer
976656826
rdf:langString
An integrally-convex set is the discrete geometry analogue of the concept of convex set in geometry. A subset X of the integer grid is integrally convex if any point y in the convex hull of X can be expressed as a convex combination of the points of X that are "near" y, where "near" means that the distance between each two coordinates is less than 1.
xsd:nonNegativeInteger
3956
