Topic
Minimum bounding box algorithms
About: Minimum bounding box algorithms is a research topic. Over the lifetime, 224 publications have been published within this topic receiving 5184 citations.
Papers published on a yearly basis
Papers
1 Aug 1996
TL;DR: A data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion that can robustly and accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates are presented.
Abstract: We present a data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion. The algorithm is applicable to all general polygonal models. It pre-computes a hierarchical representation of models using tight-fitting oriented bounding box trees (OBBTrees). At runtime, the algorithm traverses two such trees and tests for overlaps between oriented bounding boxes based on a separating axis theorem, which takes less than 200 operations in practice. It has been implemented and we compare its performance with other hierarchical data structures. In particular, it can robustly and accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates. CR
2,555 citations
1 Jan 1999
TL;DR: An efficient O(n+1/?4.5-time algorithm for computing a (1+?)-approximation of the minimum-volume bounding box of n points in R3.
Abstract: We present an efficient O(n+1/?4.5-time algorithm for computing a (1+?)-approximation of the minimum-volume bounding box of n points in R3. We also present a simpler algorithm whose running time is O(nlogn+n/?3). We give some experimental results with implementations of various variants of the second algorithm.
339 citations
TL;DR: An efficient algorithm for collision detection between static rigid objects using a dual bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres that achieves considerable speedup with respect to the existing OBB algorithms.
Abstract: We present an efficient algorithm for collision detection between static rigid objects using a dual bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. This approach combines the compactness of OBBs and the simplicity of spheres. The majority of distant objects are separated using the simpler sphere tests. The remaining objects are in close proximity, where some separation axes are significantly more effective than others. We select 5 from among the 15 potential separating axes for OBBs. Experimental results show that our algorithm achieves considerable speedup in most cases with respect to the existing OBB algorithms.
151 citations
19 Apr 1993
TL;DR: Results indicate that, depending on the complexity of the objects and the type of queries, the approximations five-corner, ellipse and rotated bounding box clearly outperform the boundingbox.
Abstract: The minimum bounding box, the convex hull, the minimum bounding four- and five-corner, rotated boxes, and the minimum bounding ellipses and circles convex conservative approximation methods for handling complex spatial objects in spatial access methods are discussed. Results indicate that, depending on the complexity of the objects and the type of queries, the approximations five-corner, ellipse and rotated bounding box clearly outperform the bounding box. It is the reduced number of false hits that yields a considerable improvement in total query time when using the proposed approximations. >
139 citations
TL;DR: These algorithms show that the mesh computer provides significantly better solutions to a variety of area and intersection problems, including the all-nearest neighbor problems for points and for sets of points.
Abstract: Asymptotically optimal parallel algorithms are presented for use on a mesh computer to determine several fundamental geometric properties of figures. For example, given multiple figures represented by the Cartesian coordinates of n or fewer planar vertices, distributed one point per processor on a two-dimensional mesh computer with n simple processing elements, Theta (n/sup 1/2/>or=-time algorithms are given for identifying the convex hull and smallest enclosing box of each figure. Given two such figures, a Theta (n/sup 1/2/>or=-time algorithm is given to decide if the two figures are linearly separable. Given n or fewer planar points, Theta (n/sup 1/2/>or=-time algorithms are given to solve the all-nearest neighbor problems for points and for sets of points. Given n or fewer circles, convex figures, hyperplanes, simple polygons, orthogonal polygons, or iso-oriented rectangles, Theta (n/sup 1/2/>or=-time algorithms are given to solve a variety of area and intersection problems. Since any serial computer has worst-case time of Omega (n) when processing n points, these algorithms show that the mesh computer provides significantly better solutions to these problems. >
129 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 3 |
| 2020 | 6 |
| 2019 | 5 |
| 2018 | 4 |
| 2017 | 5 |
| 2016 | 6 |