## Efficient collision detection using bounding volume hierarchies of k-dops (1998)

### Cached

### Download Links

- [3map.snu.ac.kr]
- [www-2.cs.cmu.edu]
- [www.cs.cmu.edu]
- [ams.sunysb.edu]
- [ams.sunysb.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Transactions on Visualization and Computer Graphics |

Citations: | 227 - 4 self |

### BibTeX

@ARTICLE{Klosowski98efficientcollision,

author = {James T. Klosowski and Martin Held and Joseph S. B. Mitchell and Henry Sowizral and Karel Zikan},

title = {Efficient collision detection using bounding volume hierarchies of k-dops},

journal = {IEEE Transactions on Visualization and Computer Graphics},

year = {1998},

pages = {21--36}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract—Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorithm is a large number of geometric objects comprising an environment, together with a set of objects moving within the environment. In addition to determining accurately the contacts that occur between pairs of objects, one needs also to do so at real-time rates. Applications such as haptic force-feedback can require over 1,000 collision queries per second. In this paper, we develop and analyze a method, based on bounding-volume hierarchies, for efficient collision detection for objects moving within highly complex environments. Our choice of bounding volume is to use a “discrete orientation polytope” (“k-dop”), a convex polytope whose facets are determined by halfspaces whose outward normals come from a small fixed set of k orientations. We compare a variety of methods for constructing hierarchies (“BV-trees”) of bounding k-dops. Further, we propose algorithms for maintaining an effective BV-tree of k-dops for moving objects, as they rotate, and for performing fast collision detection using BV-trees of the moving objects and of the environment. Our algorithms have been implemented and tested. We provide experimental evidence showing that our approach yields substantially faster collision detection than previous methods. Index Terms—Collision detection, intersection searching, bounding volume hierarchies, discrete orientation polytopes, bounding boxes, virtual reality, virtual environments. 1

### Citations

1764 | Computational geometry: an introduction - Preparata, Shamos - 1985 |

980 | The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles
- Beckmann, Kriegel, et al.
- 1990
(Show Context)
Citation Context ...e approximations of the objects, until the exact geometry of the object is reached. The choice of bounding volume has often been to use spheres [27], [28], [37] or axis-aligned bounding boxes (AABBs) =-=[7]-=-, [24], due to the simplicity in checking two such volumes for overlap (intersection). In addition, it is simple to transform these volumes as an object rotates and translates. Another bounding volume... |

658 | MANOCHA D.: OBBTree: A Hierarchical Structure for Rapid Interference Detection - GOTTSCHALK, LIN |

503 | Computational Geometry in C - O’Rourke - 1998 |

488 | The R -tree: an efficient and robust access method for points and rectangles - Beckmann, Kriegel, et al. - 1990 |

265 | I-collide: An interactive and exact collision detection system for large-scale environments
- Cohen, Lin, et al.
- 1995
(Show Context)
Citation Context ...; by assuming a bound on the acceleration of objects, he is able to avoid missing collisions between fastmoving objects. There has been a collection of innovative work which utilizes Voronoi diagrams =-=[11]-=-, [30], [31], [32] to keep track of the closest features between pairs of objects. One popular system, I-COLLIDE [11], uses spatial and temporal coherence in addition to a “sweep-and-prune” technique ... |

231 | Collision detection and response for computer animation - Moore, Wilhelms - 1988 |

213 | Fast contact force computation for nonpenetrating rigid bodies
- BARAFF
- 1994
(Show Context)
Citation Context ...urs. For a more detailed look at accurately handling collision response, please refer to the work (( by Moore and Wilhelms [33], Bouma and Vanecek [8], and the large collection of work by Baraff [3], =-=[4]-=-, [5]. Timing results for a fifth dataset, Interior, are also listed in Table 2. Images of this particular flight are shown in Figs. 5a and 5b. This industrial dataset was provided to us by The Boeing... |

177 | Approximating polyhedra with spheres for time-critical collision detection - Hubbard - 1995 |

174 | Collision detection for interactive graphics applications - Hubbard - 1995 |

154 | Automatic creation of object hierarchies for ray tracing - ith, Salmon |

136 | Curved surfaces and coherence for non-penetrating rigid body simulation
- Baraff
- 1990
(Show Context)
Citation Context ...n occurs. For a more detailed look at accurately handling collision response, please refer to the work (( by Moore and Wilhelms [33], Bouma and Vanecek [8], and the large collection of work by Baraff =-=[3]-=-, [4], [5]. Timing results for a fifth dataset, Interior, are also listed in Table 2. Images of this particular flight are shown in Figs. 5a and 5b. This industrial dataset was provided to us by The B... |

109 | Eficient Collision Detection for Animation and Robotics - Lin - 1993 |

106 |
Collision detection for moving polyhedra
- Canny
- 1986
(Show Context)
Citation Context ...wever, we are not aware of any empirical comparisons between the two algorithms.) Other approaches to collision detection have included using space-time bounds [27] and four-dimensional geometry [9], =-=[10]-=- to bound the positions of objects within the near future. By using a fourth dimension to represent the simulation time, contacts can be pinpointed exactly; however, these methods are restrictive in t... |

106 | Determining the Separation of Preprocessed Polyhedra - A Unified Approach
- Dobkin, Kirkpatrick
- 1990
(Show Context)
Citation Context ...e (and thus intersection) between two convex polytopes can be determined in O(log 2 n), where n is the total number of vertices of the polytopes, by using the Dobkin-Kirkpatrick hierarchy [15], [16], =-=[17]-=-, which takes O(n) time and space to construct. In the case of one convex polytope and one nonconvex polytope, the intersection detection time increases to O(n log n) [14], [40], while actually comput... |

105 | Improved computational methods for ray tracing - Weghorst, Hooper, et al. - 1984 |

85 |
A linear algorithm for determining the separation of convex polyhedra
- Dobkin, Kirkpatrick
- 1985
(Show Context)
Citation Context ...istance (and thus intersection) between two convex polytopes can be determined in O(log 2 n), where n is the total number of vertices of the polytopes, by using the Dobkin-Kirkpatrick hierarchy [15], =-=[16]-=-, [17], which takes O(n) time and space to construct. In the case of one convex polytope and one nonconvex polytope, the intersection detection time increases to O(n log n) [14], [40], while actually ... |

85 | Efficient algorithms for incremental distance computation - Lin, Canny - 1991 |

85 | W.: Merging BSP trees yields polyhedral set operations. In: SIGGRAPH’90 - Naylor, Amanatides, et al. - 1990 |

82 | Incremental Algorithms for Collision Detection Between Polygonal Models - Ponamgi, Manocha, et al. - 1997 |

80 | Collision detection by four-dimensional intersection testing
- Cameron
- 1990
(Show Context)
Citation Context ...m; however, we are not aware of any empirical comparisons between the two algorithms.) Other approaches to collision detection have included using space-time bounds [27] and four-dimensional geometry =-=[9]-=-, [10] to bound the positions of objects within the near future. By using a fourth dimension to represent the simulation time, contacts can be pinpointed exactly; however, these methods are restrictiv... |

77 |
Fast detection of polyhedral intersection
- Dobkin, Kirkpatrick
- 1983
(Show Context)
Citation Context ... the distance (and thus intersection) between two convex polytopes can be determined in O(log 2 n), where n is the total number of vertices of the polytopes, by using the Dobkin-Kirkpatrick hierarchy =-=[15]-=-, [16], [17], which takes O(n) time and space to construct. In the case of one convex polytope and one nonconvex polytope, the intersection detection time increases to O(n log n) [14], [40], while act... |

63 | Collision detection for animation using sphere-trees - Palmer, Grimsdale - 1995 |

62 | Evaluation of collision detection methods for virtual reality fly-throughs - Held, Klosowski, et al. - 1995 |

61 | D.: A Survey of Ray Tracing Acceleration Techniques - ARVO, KIRK - 1989 |

60 | Solving the collision detection problem - Garcia-Alonso, Serrano, et al. - 1994 |

54 |
Strip trees: A hierarchical representation for curves
- Ballard
- 1981
(Show Context)
Citation Context ...s the advantage that it can, in general, yield a better (tighter) outer approximation of an object, as its orientation can be chosen in order to make the volume as small as possible. In 1981, Ballard =-=[2]-=- created a two-dimensional hierarchical structure, known as a “strip tree,” for approximating curves, based on oriented bounding boxes in the plane. Barequet et al. [6] have recently generalized this ... |

48 | Computing the intersectiondepth of polyhedra - Dobkin, Hershberger, et al. - 1993 |

43 | tracing complex scenes - Ray - 1986 |

42 | Boxtree: A hierarchical representation for surfaces in 3D. Computer Graphics Forum
- Barequet, Chazelle, et al.
- 1996
(Show Context)
Citation Context ...l as possible. In 1981, Ballard [2] created a two-dimensional hierarchical structure, known as a “strip tree,” for approximating curves, based on oriented bounding boxes in the plane. Barequet et al. =-=[6]-=- have recently generalized this work to three dimensions (resulting in a hierarchy of OBBs known as a “BOXTREE”), for applications of oriented bounding boxes for fast ray tracing and collision detecti... |

31 | Fast Interference Detection Between Geometric Models. The Visual Computer - Lin, Manocha - 1995 |

29 |
A survey of ray tracing acceleration techniques,” in An Introduction to Ray Tracing
- Arvo, Kirk
- 1990
(Show Context)
Citation Context ...ision detection process. Hierarchies of bounding volumes have also been a very popular technique for collision detection algorithms. (They have also been widely used in other areas, e.g., ray tracing =-=[1]-=-, [20], [29], [44].) In building hierarchies on objects, one can obtain increasingly more accurate approximations of the objects, until the exact geometry of the object is reached. The choice of bound... |

27 |
Interactive simulation of solid rigid bodies
- Baraff
- 1995
(Show Context)
Citation Context ...For a more detailed look at accurately handling collision response, please refer to the work (( by Moore and Wilhelms [33], Bouma and Vanecek [8], and the large collection of work by Baraff [3], [4], =-=[5]-=-. Timing results for a fifth dataset, Interior, are also listed in Table 2. Images of this particular flight are shown in Figs. 5a and 5b. This industrial dataset was provided to us by The Boeing Comp... |

26 | Collision detection and analysis in a physically based simulation
- Bouma, Vanecek
- 1991
(Show Context)
Citation Context ...e space they occupy (using decompositions), to reduce the number of pairs of objects or primitives that need to be checked for contact. Octrees [33], [35], k-d trees [24], BSP-trees [34], brepindices =-=[8]-=-, [42], tetrahedral meshes [24], and (regular) grids [19], [24] are all examples of spatial decomposition techniques. By dividing the space occupied by the objects, one needs to check for contact betw... |

23 | Real-time collision detection for motion simulation within complex environments - Held, Klosowski, et al. - 1996 |

21 | Detecting intersection of a rectangular solid and a convex polyhedron - Greene - 1994 |

20 | BRep-Index: A Multidimensional Space Partitioning Tree - Jr - 1991 |

16 | A complete and efficient algorithm for the intersection of a general and a convex polyhedron
- Dobrindt, Mehlhorn, et al.
- 1993
(Show Context)
Citation Context ...me and space to construct. In the case of one convex polytope and one nonconvex polytope, the intersection detection time increases to O(n log n) [14], [40], while actually computing the intersection =-=[18]-=- takes O(K log K) time, where K is the size of theKLOSOWSKI ET AL.: EFFICIENT COLLISION DETECTION USING BOUNDING VOLUME HIERARCHIES OF K-DOPS 23 input plus output. Schömer [40] detects the intersecti... |

13 | The BoxTree: Enabling real-time and exact collision detection of arbitrary polyhedra - Zachmann - 1995 |

10 | C.: Subquadratic algorithms for the general collision detection problem - Schomer, Theil - 1996 |

7 | Fast interference check method using octree representation - Noborio, Fukuda, et al. - 1989 |

7 | Lower Bound of Distance in 3D - Zikan, Konečn´y - 1997 |

5 | Speed Comparison of Generalized Bounding Box Hierarchies - Held, Klosowski, et al. - 1995 |

3 | Interaktive Montagesimulation mit Kollisionserkennung - Schömer - 1994 |

3 | Exact and fast collision detection, Diploma Thesis. Technische Hochschule Darmstadt, Fachbereich Informatik - Zachmann - 1994 |

2 | T-BOX: The intersection of three mini-max boxes - Crosnier, Rossignac - 1995 |

1 | A library of efficient and reliable intersection routines - Held - 1997 |

1 |
T-BOX: The Intersection of Three Mini-Max Boxes,” internal report
- Crosnier, Rossignac
- 1995
(Show Context)
Citation Context ...re particularly natural; see Section 3.3.3 for more detail. Researchers at IBM have used the same 18-dops (which they call “triboxes” or “T-boxes”) for visual approximation purposes within 3DIX [12], =-=[13]-=-. This idea of using planes of fixed orientations to approximate a set of primitive objects was first introduced in the ray tracing work of Kay and Kajiya [29]. Axis-aligned bounding boxes (AABBs) are... |

1 |
Computing the
- Dobkin, Hershberger, et al.
- 1993
(Show Context)
Citation Context ...atrick hierarchy [15], [16], [17], which takes O(n) time and space to construct. In the case of one convex polytope and one nonconvex polytope, the intersection detection time increases to O(n log n) =-=[14]-=-, [40], while actually computing the intersection [18] takes O(K log K) time, where K is the size of theKLOSOWSKI ET AL.: EFFICIENT COLLISION DETECTION USING BOUNDING VOLUME HIERARCHIES OF K-DOPS 23 ... |