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.
2019
2019
Stability analysis of kinetic oriented bounding boxes
We study the oriented bounding box on a set of continuously moving points. The smallest oriented bounding box is the smallest… 
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… 
2012
2012
Smallest axis-parallel rectangle enclosing at least k points
Let P be a set of n points on a two-dimensional plane. In this work, we present an algorithm that identies a smallest area axis… 
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… 
2009
2009
Bacterial Colony Chemotaxis Algorithm for Guillotine Rectangle Cutting Problem
Bacterial Colony Chemotaxis (BCC), which has good performance of global convergence and better convergence speed, is one of the… 
2009
2009
Obstacle Avoidance in Dynamic Virtual Worlds
3D Virtual Worlds are becoming a new popular medium for a vast variety of so-called “serious games” applications. These serious… 
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
Constant Time Computational Geometry On Reconfigurable Meshes With Buses
We develop Ο(1) time algorithms for the following computational geometry problems: convex hull, smallest enclosing box, ECDF… 
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… 
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… 
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)