Content deleted Content added
m Reverted edit by 58.158.179.229 (talk) to last version by David Eppstein |
→top: Add application |
||
Line 7:
The degree to which an "overlapping [[rectangle]]s" 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]].
[[File:Detected-with-YOLO--Schreibtisch-mit-Objekten.jpg|thumb|Minimum bounding rectangles used in [[computer vision]] ]]
MBRs are also an essential prerequisite for the [[R-tree]] method of [[spatial index]]ing.
| |||