This HTML5 document contains 28 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n10http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n16https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n9http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Integrally-convex_set
rdfs:label
Integrally-convex set
rdfs:comment
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.
foaf:depiction
n9:Integrally-convex-with-triangulation.svg n9:Non-integrally-convex.svg
dct:subject
dbc:Discrete_geometry
dbo:wikiPageID
63326139
dbo:wikiPageRevisionID
976656826
dbo:wikiPageWikiLink
dbr:Convex_hull n10:Non-integrally-convex.svg dbr:Convex_combination n10:Integrally-convex-with-triangulation.svg dbr:Convex_set dbc:Discrete_geometry dbr:Discrete_geometry dbr:Triangulation_(topology)
owl:sameAs
wikidata:Q96382181 n16:C2tYs
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:thumbnail
n9:Non-integrally-convex.svg?width=300
dbo:abstract
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.
prov:wasDerivedFrom
wikipedia-en:Integrally-convex_set?oldid=976656826&ns=0
dbo:wikiPageLength
3956
foaf:isPrimaryTopicOf
wikipedia-en:Integrally-convex_set
Subject Item
dbr:Convex_set
dbo:wikiPageWikiLink
dbr:Integrally-convex_set
Subject Item
dbr:Discrete_fixed-point_theorem
dbo:wikiPageWikiLink
dbr:Integrally-convex_set
Subject Item
dbr:Integrally_convex
dbo:wikiPageWikiLink
dbr:Integrally-convex_set
dbo:wikiPageRedirects
dbr:Integrally-convex_set
Subject Item
wikipedia-en:Integrally-convex_set
foaf:primaryTopic
dbr:Integrally-convex_set