An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The grid cell topology is studied in digital topology as part of the theoretical basis for (low-level) algorithms in computer image analysis or computer graphics. The elements of the n-dimensional grid cell topology (n ≥ 1) are all n-dimensional grid cubes and their k-dimensional faces ( for 0 ≤ k ≤ n−1); between these a partial order A ≤ B is defined if A is a subset of B (and thus also dim(A) ≤ dim(B)). The grid cell topology is the Alexandrov topology (open sets are up-sets) with respect to this partial order. (See also poset topology.)

Property Value
dbo:abstract
  • The grid cell topology is studied in digital topology as part of the theoretical basis for (low-level) algorithms in computer image analysis or computer graphics. The elements of the n-dimensional grid cell topology (n ≥ 1) are all n-dimensional grid cubes and their k-dimensional faces ( for 0 ≤ k ≤ n−1); between these a partial order A ≤ B is defined if A is a subset of B (and thus also dim(A) ≤ dim(B)). The grid cell topology is the Alexandrov topology (open sets are up-sets) with respect to this partial order. (See also poset topology.) Alexandrov and Hopf first introduced the grid cell topology, for the two-dimensional case, within an exercise in their text Topologie I (1935). A recursive method to obtain n-dimensional grid cells and an intuitive definition for grid cell manifolds can be found in Chen, 2004. It is related to digital manifolds. (en)
dbo:wikiPageID
  • 5909220 (xsd:integer)
dbo:wikiPageLength
  • 1616 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 785276645 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • The grid cell topology is studied in digital topology as part of the theoretical basis for (low-level) algorithms in computer image analysis or computer graphics. The elements of the n-dimensional grid cell topology (n ≥ 1) are all n-dimensional grid cubes and their k-dimensional faces ( for 0 ≤ k ≤ n−1); between these a partial order A ≤ B is defined if A is a subset of B (and thus also dim(A) ≤ dim(B)). The grid cell topology is the Alexandrov topology (open sets are up-sets) with respect to this partial order. (See also poset topology.) (en)
rdfs:label
  • Grid cell topology (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:knownFor of
is dbo:wikiPageWikiLink of
is dbp:knownFor of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License