| http://dbpedia.org/ontology/abstract
|
An integrally-convex set is the discrete g … 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.tween each two coordinates is less than 1.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Non-integrally-convex.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
63326139
|
| http://dbpedia.org/ontology/wikiPageLength
|
3956
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
976656826
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Discrete_geometry +
, http://dbpedia.org/resource/File:Integrally-convex-with-triangulation.svg +
, http://dbpedia.org/resource/Convex_hull +
, http://dbpedia.org/resource/Category:Discrete_geometry +
, http://dbpedia.org/resource/Convex_set +
, http://dbpedia.org/resource/Triangulation_%28topology%29 +
, http://dbpedia.org/resource/Convex_combination +
, http://dbpedia.org/resource/File:Non-integrally-convex.svg +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Discrete_geometry +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Integrally-convex_set?oldid=976656826&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Integrally-convex-with-triangulation.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Non-integrally-convex.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Integrally-convex_set +
|
| owl:sameAs |
https://global.dbpedia.org/id/C2tYs +
, http://www.wikidata.org/entity/Q96382181 +
, http://dbpedia.org/resource/Integrally-convex_set +
|
| rdfs:comment |
An integrally-convex set is the discrete g … 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.tween each two coordinates is less than 1.
|
| rdfs:label |
Integrally-convex set
|
