Skip to search formSkip to main contentSkip to account menu

Minimum bounding rectangle

Known as: Bounding rectangle, MBR 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Earth faces potential danger from Meteors that enter its atmosphere. During their entry, these objects begin ablating due to… 
2014
2014
Shape extraction and analysis is one of the most important task in image processing. The accuracy of the shape features… 
2010
2010
  • Guobin LiJine Tang
  • 2010
  • Corpus ID: 15422099
The K-neighbor query algorithm is an important class of search algorithm in the spatial database, this paper will adopt the K… 
2008
2008
This paper proposess a novel time series representation called GMBR based on Minimum Bounding Rectangle in which the binary idea… 
2006
2006
A new index method,named 3D~+ R-tree,is presented on the basis of classical 3D R-tree.3D~+ R-tree tries to improve the query… 
2003
2003
This paper describes a feasibility study into the marking (grading) of diagrams automatically. The diagrams were produced by… 
1999
1999
Designing and tuning access methods (AMs) has always been more of a black art than a rigorous discipline, with performance… 
1998
1998
Existing algorithms for floorplan topology generation by rectangular dualization usually do not consider sizing issues. In this… 
1986
1986
SummaryWe present an optimal algorithm to determine whether a placement of N isothetic non-overlapping rectangles (macros) can be…