Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1134256> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Q1134256 subject Q1457673.
- Q1134256 subject Q6309001.
- Q1134256 subject Q6436127.
- Q1134256 subject Q7700464.
- Q1134256 subject Q8939667.
- Q1134256 abstract "The minimum bounding rectangle (MBR), also known as bounding box or envelope, is an expression of the maximum extents of a 2-dimensional object (e.g. point, line, polygon) or set of objects within its (or their) 2-D (x, y) coordinate system, in other words min(x), max(x), min(y), max(y). The MBR is a 2-dimensional case of the minimum bounding box.MBRs are frequently used as an indication of the general position of a geographic feature or dataset, for either display, first-approximation spatial query, or spatial indexing purposes. The degree to which an "overlapping rectangles" query based on MBRs will be satisfactory (in other words, produce a low number of "false positive" hits) will depend on the extent to which individual spatial objects occupy (fill) their associated MBR. If the MBR is full or nearly so (for example, a mapsheet aligned with axes of latitude and longitude will normally entirely fill its associated MBR in the same coordinate space), then the "overlapping rectangles" test will be entirely reliable for that and similar spatial objects. On the other hand, if the MBR describes a dataset consisting of a diagonal line, or a small number of disjunct points (patchy data), then most of the MBR will be empty and an "overlapping rectangles" test will produce a high number of false positives. One system that attempts to deal with this problem, particularly for patchy data, is c-squares.MBRs are also an essential prerequisite for the R-tree method of spatial indexing.".
- Q1134256 thumbnail Minimum_bounding_rectangle.svg?width=300.
- Q1134256 wikiPageExternalLink index.shtml.
- Q1134256 wikiPageExternalLink geospatialmethods.org.
- Q1134256 wikiPageExternalLink searching.html.
- Q1134256 wikiPageExternalLink v2_0698.pdf.
- Q1134256 wikiPageWikiLink Q1071.
- Q1134256 wikiPageWikiLink Q11210.
- Q1134256 wikiPageWikiLink Q1198051.
- Q1134256 wikiPageWikiLink Q1457673.
- Q1134256 wikiPageWikiLink Q1477538.
- Q1134256 wikiPageWikiLink Q180160.
- Q1134256 wikiPageWikiLink Q209.
- Q1134256 wikiPageWikiLink Q2302053.
- Q1134256 wikiPageWikiLink Q278934.
- Q1134256 wikiPageWikiLink Q361892.
- Q1134256 wikiPageWikiLink Q483130.
- Q1134256 wikiPageWikiLink Q5005963.
- Q1134256 wikiPageWikiLink Q5367164.
- Q1134256 wikiPageWikiLink Q5974123.
- Q1134256 wikiPageWikiLink Q624610.
- Q1134256 wikiPageWikiLink Q6309001.
- Q1134256 wikiPageWikiLink Q6436127.
- Q1134256 wikiPageWikiLink Q6489240.
- Q1134256 wikiPageWikiLink Q6865426.
- Q1134256 wikiPageWikiLink Q7700464.
- Q1134256 wikiPageWikiLink Q776903.
- Q1134256 wikiPageWikiLink Q8939667.
- Q1134256 wikiPageWikiLink Q926165.
- Q1134256 comment "The minimum bounding rectangle (MBR), also known as bounding box or envelope, is an expression of the maximum extents of a 2-dimensional object (e.g. point, line, polygon) or set of objects within its (or their) 2-D (x, y) coordinate system, in other words min(x), max(x), min(y), max(y).".
- Q1134256 label "Minimum bounding rectangle".
- Q1134256 depiction Minimum_bounding_rectangle.svg.
