Results 1  10
of
50
OBBTree: A hierarchical structure for rapid interference detection
 Proc. ACM SIGGRAPH, 171–180
, 1996
"... {gottscha,lin,manocha}©cs. unc.edu 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 mode ..."
Abstract

Cited by 660 (42 self)
 Add to MetaCart
{gottscha,lin,manocha}©cs. unc.edu 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 bounding box trees. At runtime, the algorithm traverses the tree and tests for overlaps between oriented bounding boxes based on a new 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 accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates, almost one order of magnitude faster than earlier methods.
ICOLLIDE: An interactive and exact collision detection system for largescale environments
 In Proc. of ACM Interactive 3D Graphics Conference
, 1995
"... We present an exact and interactive collision detection system, ICOLLIDE, for largescale environments. Such environments are characterized by the number of objects undergoing rigid motion and the complexity of the models. The algorithm does not assume the objects ’ motions can be expressed as a c ..."
Abstract

Cited by 265 (25 self)
 Add to MetaCart
We present an exact and interactive collision detection system, ICOLLIDE, for largescale environments. Such environments are characterized by the number of objects undergoing rigid motion and the complexity of the models. The algorithm does not assume the objects ’ motions can be expressed as a closed form function of time. The collision detection system is general and can be easily interfaced with a variety of applications. The algorithm uses a twolevel approach based on pruning multipleobject pairs using bounding boxes and performing exact collision detection between selected pairs of polyhedral models. We demonstrate the performance of the system in walkthrough and simulation environments consisting of a large number of moving objects. In particular, the system takes less than l/20 of a second to determine all the collisions and contacts in an environment consisting of more than a 1000 moving polytopes, each consisting of more than 50 faces on an HP9000/750. 1
Approximating Polyhedra with Spheres for TimeCritical Collision Detection
 ACM Transactions on Graphics
, 1996
"... This paper presents a method for approximating polyhedral objects to support a timecritical collisiondetection algorithm. The approximations are hierarchies of spheres, and they allow the timecritical algorithm to progressively refine the accuracy of its detection, stopping as needed to maintain ..."
Abstract

Cited by 177 (1 self)
 Add to MetaCart
This paper presents a method for approximating polyhedral objects to support a timecritical collisiondetection algorithm. The approximations are hierarchies of spheres, and they allow the timecritical algorithm to progressively refine the accuracy of its detection, stopping as needed to maintain the realtime performance essential for interactive applications. The key to this approach is a preprocess that automatically builds tightly fitting hierarchies for rigid and articulated objects. The preprocess uses medialaxis surfaces, which are skeletal representations of objects. These skeletons guide an optimization technique that gives the hierarchies accuracy properties appropriate for collision detection. In a sample application, hierarchies built this way allow the timecritical collisiondetection algorithm to have acceptable accuracy, improving significantly on that possible with hierarchies built by previous techniques. The performance of the timecritical algorithm in this appli...
Collision Detection for Interactive Graphics Applications
 IEEE Transactions on Visualization and Computer Graphics
, 1995
"... Solid objects in the real world do not pass through each other when they collide. Enforcing this property of "solidness" is important in many interactive graphics applications; for example, solidness makes virtual reality more believable, and solidness is essential for the correctness of vehicle sim ..."
Abstract

Cited by 175 (5 self)
 Add to MetaCart
Solid objects in the real world do not pass through each other when they collide. Enforcing this property of "solidness" is important in many interactive graphics applications; for example, solidness makes virtual reality more believable, and solidness is essential for the correctness of vehicle simulators. These applications use a collisiondetection algorithm to enforce the solidness of objects. Unfortunately, previous collisiondetection algorithms do not adequately address the needs of interactive applications. To work in these applications, a collisiondetection algorithm must run at realtime rates, even when many objects can collide, and it must tolerate objects whose motion is specified "on the fly" by a user. This dissertation describes a new collisiondetection algorithm that meets these criteria through approximation and graceful degradation, elements of timecritical computing. The algorithm is not only fast but also interruptible, allowing an application to trade accuracy ...
Efficient Collision Detection for Animation and Robotics
, 1993
"... We present efficient algorithms for collision detection and contact determination between geometric models, described by linear or curved boundaries, undergoing rigid motion. The heart of our collision detection algorithm is a simple and fast incremental method to compute the distance between two ..."
Abstract

Cited by 109 (19 self)
 Add to MetaCart
We present efficient algorithms for collision detection and contact determination between geometric models, described by linear or curved boundaries, undergoing rigid motion. The heart of our collision detection algorithm is a simple and fast incremental method to compute the distance between two convex polyhedra. It utilizes convexity to establish some local applicability criteria for verifying the closest features. A preprocessing procedure is used to subdivide each feature's neighboring features to a constant size and thus guarantee expected constant running time for each test. The expected constant time performance is an attribute from exploiting the geometric coherence and locality. Let n be the total number of features, the expected run time is between O( p n) and O(n) ...
Fast proximity queries with swept sphere volumes
, 1999
"... We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown ..."
Abstract

Cited by 95 (18 self)
 Add to MetaCart
We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some offset. The set of core primitive shapes includes a point, line, and rectangle. This family of bounding volumes provides varying tightness of t to the underlying geometry. Furthermore, we describe efficient and accurate algorithms to perform different queries using these bounding volumes. We present a novel analysis of proximity queries that highlights the relationship between collision detection and distance computation. We also present traversal techniques for accelerating distance queries. These algorithms have been used to perform proximity queries for applications including virtual prototyping, dynamic simulation, and motion planning on complex models. As compared to earlier algorithms based on bounding volume hierarchies for separation distance and approximate distance computation, our algorithms have
3D Collision Detection: A Survey
 Computers and Graphics
, 2000
"... Many applications in Computer Graphics require fast and robust 3D collision detection algorithms. These algorithms can be grouped into four approaches: spacetime volume intersection, swept volume interference, multiple interference detection and trajectory parameterization. While some approaches ar ..."
Abstract

Cited by 84 (3 self)
 Add to MetaCart
Many applications in Computer Graphics require fast and robust 3D collision detection algorithms. These algorithms can be grouped into four approaches: spacetime volume intersection, swept volume interference, multiple interference detection and trajectory parameterization. While some approaches are linked to a particular object representation scheme (e.g., spacetime volume intersection is particularly suited to a CSG representation), others do not. The multiple interference detection approach has been the most widely used under a variety of sampling strategies, reducing the collision detection problem to multiple calls to static interference tests. In most cases, these tests boil down to detecting intersections between simple geometric entities, such as spheres, boxes aligned with the coordinate axes, or polygons and segments. The computational cost of a collision detection algorithm depends not only on the complexity of the basic interference test used, but also on the ...
Incremental algorithms for collision detection between solid models
 IEEE Transactions on Visualization and Computer Graphics
, 1995
"... solid models ..."
Fast and Simple 2D Geometric Proximity Queries Using Graphics Hardware
, 2001
"... We present a new approach for computing generalized proximity information of arbitrary 2D objects using graphics hardware. Using multipass rendering techniques and accelerated distance computation, our algorithm performs proximity queries not only for detecting collisions, but also for computing in ..."
Abstract

Cited by 54 (11 self)
 Add to MetaCart
We present a new approach for computing generalized proximity information of arbitrary 2D objects using graphics hardware. Using multipass rendering techniques and accelerated distance computation, our algorithm performs proximity queries not only for detecting collisions, but also for computing intersections, separation distance, penetration depth, and contact points and normals. Our hybrid geometry and imagebased approach balances computation between the CPU and graphics subsystems. Geometric objectspace techniques coarsely localize potential intersection regions or closest features between two objects, and imagespace techniques compute the lowlevel proximity information in these regions. Most of the proximity information is derived from a distance field computed using graphics hardware. We demonstrate the performance in collision response computation for rigid and deformable body dynamics simulations. Our approach provides proximity information at interactive rates for a variet...