FAQ

Minimum bounding box algorithms

Known as: Minimum-area enclosing rectangle, Smallest bounding rectangle, Smallest bounding box 
In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points. It is a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2016
012319892016

Related topics

Related topics

10 relations
Bounding volumeComputational geometryConvex hullCoreset
(More)

Related mentions per year

Related mentions per year

1951-2018
1960198020002020
Minimum bounding box algorithms
Convex hull
Computational geometry
List of algorithms
Minimum bounding box
Bounding volume

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Symmetry in Gardens of Eden
Conway’s Game of Life has inspired enthusiasts to search for a wide range of patterns for this classic cellular automaton. One… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2012
2012
Automated object-based classification of topography from SRTM data
Object attribute Description FID The ID number of the object Area_Pxl Area of the object measured in cells (1 cell is appr. 1 km… (More)
Is this relevant?
2010
2010
A New K-Neighbor Search Algorithm Based on Variable Incremental Dynamic Grid Division
K-neighbor search algorithm is an important class of query type in the spatial database, a new K-neighbor search algorithm based… (More)
Is this relevant?
2009
2009
Tracking an Extended Object Modeled as an Axis-Aligned Rectangle
In many tracking applications, the extent of the target object is neglected and it is assumed that the received measurements stem… (More)
  • figure 1
Is this relevant?
2006
2006
Finding the Best-Fit Bounding-Boxes
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Optimal geometric algorithms for digitized images on arrays with reconfigurable optical buses
Geometric algorithms play an important role in computer graphics and digital image analysis. This paper makes an improvement of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2002
2002
Computational Geometry On The OTIS-Mesh Optoelectronic Computer
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Efficient BSR-Based Parallel Algorithms for Geometrical Problems
This paper presents BSR-parallel algorithms for three geometrical problems : point location, convex hull and smallest enclosing… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
1997
1997
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Rectangle-packing-based module placement
The first and the most critical stage in VLSI layout design is the placement, the background of which is the rectangle packing… (More)
Is this relevant?