Results 1  10
of
589
OBBTree: A hierarchical structure for rapid interference detection
 PROC. ACM SIGGRAPH, 171–180
, 1996
"... 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 and curved models. It precomputes a hierarchical representation of models using tightfitting oriented bo ..."
Abstract

Cited by 845 (53 self)
 Add to MetaCart
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 and curved models. It precomputes a hierarchical representation of models using tightfitting oriented
Fast and Accurate Collision Detection for Haptic Interaction Using a Three DegreeofFreedom ForceFeedback Device
, 2000
"... We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we precompute a hybrid hierarchical representation, consisting of uniform grids (represented using a hash table) and trees of tightfitting oriented bounding box trees (OBBTrees ..."
Abstract

Cited by 50 (0 self)
 Add to MetaCart
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we precompute a hybrid hierarchical representation, consisting of uniform grids (represented using a hash table) and trees of tightfitting oriented bounding box trees
The Xtree: An index structure for highdimensional data
 In Proceedings of the Int’l Conference on Very Large Data Bases
, 1996
"... In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*tree are not adequate for indexing highdimensional data sets. The major problem of Rtreebased index structures is the over ..."
Abstract

Cited by 592 (17 self)
 Add to MetaCart
is the overlap of the bounding boxes in the directory, which increases with growing dimension. To avoid this problem, we introduce a new organization of the directory which uses a split algorithm minimizing overlap and additionally utilizes the concept of supernodes. The basic idea of overlapminimizing split
Efficient collision detection using bounding volume hierarchies of kdops
 IEEE Transactions on Visualization and Computer Graphics
, 1998
"... 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 ..."
Abstract

Cited by 290 (4 self)
 Add to MetaCart
orientations. We compare a variety of methods for constructing hierarchies (“BVtrees”) of bounding kdops. Further, we propose algorithms for maintaining an effective BVtree of kdops for moving objects, as they rotate, and for performing fast collision detection using BVtrees of the moving objects
Collision Queries using Oriented Bounding Boxes
, 2000
"... Collision Queries using Oriented Bounding Boxes Under the direction of Dinesh Manocha and Ming Lin Bounding volume hierarchies (BVHs) have been used widely in collision detection algorithms. The most commonly used bounding volume types are axisaligned bounding boxes (AABBs) and spheres, which hav ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
have simple representations, compact storage, and are easy to implement. This dissertation explores the use of oriented bounding boxes (OBBs), which may be aligned with the underlying geometry to fit more tightly. We believe that OBBs historically have been used less often because previously known
Efficient Collision Detection of Complex Deformable Models using AABB Trees
 J. Graphics Tools
, 1998
"... We present a scheme for exact collision detection between complex models undergoing rigid motion and deformation. The scheme relies on a hierarchical model representation using axisaligned bounding boxes (AABBs). In recent work, AABB trees have been shown to be slower than oriented bounding box ..."
Abstract

Cited by 231 (2 self)
 Add to MetaCart
We present a scheme for exact collision detection between complex models undergoing rigid motion and deformation. The scheme relies on a hierarchical model representation using axisaligned bounding boxes (AABBs). In recent work, AABB trees have been shown to be slower than oriented bounding
Dynamic Collision Detection using Oriented Bounding Boxes
"... this paper are motivated by the 1996 SIGGRAPH article [1] on oriented bounding boxes (OBBs) and on OBB trees that are used to provide a hierarchical way of deciding if two objects intersect. The computational goal is to minimize the time spent determining if two objects do not intersect. An OBB tree ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
this paper are motivated by the 1996 SIGGRAPH article [1] on oriented bounding boxes (OBBs) and on OBB trees that are used to provide a hierarchical way of deciding if two objects intersect. The computational goal is to minimize the time spent determining if two objects do not intersect. An OBB
Refinements to NearestNeighbor Searching in kDimensional Trees
 ALGORITHMICA
, 1991
"... This note presents a simplification and generalization of an algorithm for searching kdimensional trees for nearest neighbors reported by Friedman et al. I3]. If the distance between records is measured using Lz, the Euclidean orm, the data structure used by the algorithm to determine the bounds ..."
Abstract

Cited by 123 (0 self)
 Add to MetaCart
This note presents a simplification and generalization of an algorithm for searching kdimensional trees for nearest neighbors reported by Friedman et al. I3]. If the distance between records is measured using Lz, the Euclidean orm, the data structure used by the algorithm to determine the bounds
Optimized View Frustum Culling Algorithms for Bounding Boxes
 Journal of Graphics Tools
, 2000
"... This paper presents optimizations for faster view frustum culling (VFC) for axis aligned bounding box (AABB) and oriented bounding box (OBB) hierarchies. We exploit frametoframe coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we pote ..."
Abstract

Cited by 54 (0 self)
 Add to MetaCart
This paper presents optimizations for faster view frustum culling (VFC) for axis aligned bounding box (AABB) and oriented bounding box (OBB) hierarchies. We exploit frametoframe coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we
Results 1  10
of
589