Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,293 papers from all fields of science
Search
Sign In
Create Free Account
Minimum bounding box algorithms
Known as:
Minimum-area enclosing rectangle
, Smallest bounding rectangle
, Smallest bounding box
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Bounding volume
Computational geometry
Convex hull
Coreset
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Symmetry in Gardens of Eden
C. Hartman
,
Marijn J. H. Heule
,
K. Kwekkeboom
,
Alain Noels
Electronic Journal of Combinatorics
2013
Corpus ID: 14224067
Conway's Game of Life has inspired enthusiasts to search for a wide range of patterns for this classic cellular automaton. One…
Expand
2012
2012
Smallest axis-parallel rectangle enclosing at least k points
P. Ranjan
,
Sinha Mahapatra
2012
Corpus ID: 18293663
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…
Expand
2009
2009
The Bichromatic Square and Rectangle Problems ?
Jonathan Backer
,
J. Keil
2009
Corpus ID: 18836620
We examine a variant of the maximum empty square (or rectangle) problem: Find an axis-aligned square (or rectangle) that contains…
Expand
2009
2009
Bacterial Colony Chemotaxis Algorithm for Guillotine Rectangle Cutting Problem
Pengzhe Wen
,
Liu Wen-xia
Global Congress on Intelligent Systems
2009
Corpus ID: 17585504
Bacterial Colony Chemotaxis (BCC), which has good performance of global convergence and better convergence speed, is one of the…
Expand
2009
2009
Obstacle Avoidance in Dynamic Virtual Worlds
A. Bogdanovych
2009
Corpus ID: 17020804
3D Virtual Worlds are becoming a new popular medium for a vast variety of so-called “serious games” applications. These serious…
Expand
2007
2007
A Linear Time Algorithm for Optimum Tree Placement
S. Chatterjee
,
Zile Wei
,
A. Mishchenko
,
R. Brayton
2007
Corpus ID: 18090795
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…
Expand
2007
2007
Constant Time Computational Geometry On Reconfigurable Meshes With Buses
M. Nigam
,
S. Sahni
2007
Corpus ID: 116539758
We develop Ο(1) time algorithms for the following computational geometry problems: convex hull, smallest enclosing box, ECDF…
Expand
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…
Expand
1994
1994
Computing External Watchman Routes on Pram, BSR, and Interconnection Network Models of Parallel Computation
L. Gewali
,
I. Stojmenovic
Parallel Processing Letters
1994
Corpus ID: 38101587
An external watchman route in the presence of a polygonal obstacle is a closed path such that each point in the exterior of the…
Expand
1994
1994
Constant Time Digital Geometry Algorithms on the Scan Model of Parallel Computation
B. Djokic
,
J. Ruppert
,
I. Stojmenovic
International journal of high speed computing
1994
Corpus ID: 33597633
Assume that a black/white n×n image is stored one pixel per element of a vector of length n2. We consider determining some…
Expand
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)
ACCEPT & CONTINUE