Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Bounding volumeComputational geometryConvex hullCoreset

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Voltage-Island based Floorplanning in VLSI for Area Minimization using Metaheuristic Optimization Algorithm
Floor planning is the primary step of the physical design in the Very Large Scale Integration (VLSI) design flow. It is used to… 
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… 
2009
2009
The Bichromatic Square and Rectangle Problems ?
We examine a variant of the maximum empty square (or rectangle) problem: Find an axis-aligned square (or rectangle) that contains… 
2007
2007
A Linear Time Algorithm for Optimum Tree Placement
Let N be a point placed directed graph and G be a sub-graph of N . We study the point placement problem of optimally re-placing… 
2007
2007
Identification of Paintings in Camera-Phone Images
This paper presents the algorithm developed, for the EE 368 course project, to identify paintings in query images taken with a… 
2007
2007
Fast Thermal Exploration in the Preliminary Design of Electronic Products
This paper presents the verification of a model that supports the fast thermal exploration of electronic product concepts. The… 
2001
2001
Efficient BSR-based parallel algorithms for geometrical problems
  • D. SeméJ. Myoupo
  • Proceedings Ninth Euromicro Workshop on Parallel…
  • 2001
  • Corpus ID: 29781942
This paper presents BSR-parallel algorithms for three geometrical problems: point location, convex hull and smallest enclosing… 
1994
1994
Constant Time Digital Geometry Algorithms on the Scan Model of Parallel Computation
Assume that a black/white n×n image is stored one pixel per element of a vector of length n2. We consider determining some… 
1994
1994
Computing External Watchman Routes on Pram, BSR, and Interconnection Network Models of Parallel Computation
An external watchman route in the presence of a polygonal obstacle is a closed path such that each point in the exterior of the… 
1992
1992
An optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer (for rectangle read triangle)
The authors consider the problem of finding the smallest triangle circumscribing a convex polygon with n edges. They show that… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)