| http://dbpedia.org/ontology/abstract
|
In mathematics, a subpaving is a set of no … In mathematics, a subpaving is a set of nonoverlapping boxes of R⁺. A subset X of Rⁿ can be approximated by two subpavings X⁻ and X⁺ such that X⁻ ⊂ X ⊂ X⁺. In R¹ the boxes are line segments, in R² rectangles and in Rⁿ hyperrectangles. A R² subpaving can be also a "non-regular tiling by rectangles", when it has no holes. Boxes present the advantage of being very easily manipulated by computers, as they form the heart of interval analysis. Many interval algorithms naturally provide solutions that are regular subpavings. In computation, a well-known application of subpaving in R² is the Quadtree data structure. In image tracing context and other applications is important to see X⁻ as topological interior, as illustrated.⁻ as topological interior, as illustrated.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Rectangular-covering.png?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
39210398
|
| http://dbpedia.org/ontology/wikiPageLength
|
4595
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1103319740
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Set_inversion +
, http://dbpedia.org/resource/Hyperrectangle +
, http://dbpedia.org/resource/Subset +
, http://dbpedia.org/resource/File:Wiki_subpaving3.png +
, http://dbpedia.org/resource/File:Wiki_subpaving1.png +
, http://dbpedia.org/resource/File:Wiki_subpaving2.png +
, http://dbpedia.org/resource/Category:Geometry +
, http://dbpedia.org/resource/File:Rectangular-covering.png +
, http://dbpedia.org/resource/Tessellation +
, http://dbpedia.org/resource/Motion_planning +
, http://dbpedia.org/resource/Image_tracing +
, http://dbpedia.org/resource/Category:Topology +
, http://dbpedia.org/resource/Path_connected +
, http://dbpedia.org/resource/Mathematics +
, http://dbpedia.org/resource/Quadtree +
, http://dbpedia.org/resource/Interior_%28topology%29 +
, http://dbpedia.org/resource/Topology +
, http://dbpedia.org/resource/Computation +
, http://dbpedia.org/resource/Inequality_%28mathematics%29 +
, http://dbpedia.org/resource/Interval_arithmetic +
|
| http://dbpedia.org/property/b
|
1
, 2
|
| http://dbpedia.org/property/p
|
2
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Su +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Geometry +
, http://dbpedia.org/resource/Category:Topology +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Set +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Subpaving?oldid=1103319740&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Rectangular-covering.png +
, http://commons.wikimedia.org/wiki/Special:FilePath/Wiki_subpaving1.png +
, http://commons.wikimedia.org/wiki/Special:FilePath/Wiki_subpaving2.png +
, http://commons.wikimedia.org/wiki/Special:FilePath/Wiki_subpaving3.png +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Subpaving +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q17106104 +
, http://rdf.freebase.com/ns/m.0tkgh9x +
, http://dbpedia.org/resource/Subpaving +
, https://global.dbpedia.org/id/fLXm +
|
| rdfs:comment |
In mathematics, a subpaving is a set of no … In mathematics, a subpaving is a set of nonoverlapping boxes of R⁺. A subset X of Rⁿ can be approximated by two subpavings X⁻ and X⁺ such that X⁻ ⊂ X ⊂ X⁺. In R¹ the boxes are line segments, in R² rectangles and in Rⁿ hyperrectangles. A R² subpaving can be also a "non-regular tiling by rectangles", when it has no holes. Boxes present the advantage of being very easily manipulated by computers, as they form the heart of interval analysis. Many interval algorithms naturally provide solutions that are regular subpavings.ide solutions that are regular subpavings.
|
| rdfs:label |
Subpaving
|
