Minimum bounding box

Known as: Minimum enclosing rectangle, Axis aligned bounding box, Object oriented bounding box 
In geometry, the minimum or smallest bounding or enclosing box for a point set (S) in N dimensions is the box with the smallest measure (area, volume… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
The use of object proposals is an effective recent approach for increasing the computational efficiency of object detection. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Semantic part localization can facilitate fine-grained categorization by explicitly isolating subtle appearance differences… (More)
Is this relevant?
2012
2012
In recent years there has been significant use of regular cross-polytopes (regular octahedrons or hyper-diamonds) as constructs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We introduce a 120 class Stanford Dogs dataset, a challenging and large-scale dataset aimed at fine-grained image categorization… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
User-provided object bounding box is a simple and popular interaction paradigm considered by many existing interactive image… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Thinking about intelligent robots involves consideration of how such systems can be enabled to perceive, interpret and act in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper presents optimizations for faster view frustum culling (VFC) for axis aligned bounding box (AABB) and oriented… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Collision Queries using Oriented Bounding Boxes Under the direction of Dinesh Manocha and Ming Lin Bounding volume hierarchies… (More)
  • figure 2.13
  • figure 3.11
  • figure 4.5
  • figure 5.5
  • figure 5.11
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present an efficient O(n + l/~~.~) time algorithm for computing an (I +E)-approximation of the minimum-volume bounding box of… (More)
Is this relevant?
1999
1999
Bounding boxes are commonly used in computer graphics and other fields to improve the performance of algorithms that should… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?