Real-Time Collision Detection

By Christer Ericson. 2004

1,292 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/a0a9ca90e1a90debf8b7c2eb7e0bd089dd46ba14

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Building and Construction

Citations in the corpus

A Potential Field-Based Model Predictive Path-Planning Controller for Autonomous Road Vehicles (2017, background): “More information on the signed distance can be found in [25].”
An isogeometric collocation method for frictionless contact of Cosserat rods (2017, methodology): “For a computationally efficient implementation of this search, which requires comparison of many evaluation points r(η i ) and r (η j ) with each other, nearest neigbhbour algorithms and data structures such as bounding volume hierarchies can be considered [48].”
FUEL: Fast UAV Exploration Using Incremental Frontier Structure and Hierarchical Planning (2020, background): “These two processes are inspired by the broad/narrow phase collision detection algorithms [32], which eliminate most unaffected clusters in a fast way and significantly reduce the number of expensive precise checks.”
Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization (2013, methodology): “Our method for penalizing collisions is based on the notion of minimum translation distance, common in collision detection [9].”
Fast BVH Construction on GPUs (2009, methodology): “Going beyond ray tracing, similar hierarchies have also been used for GPU-based collision detection [Eri04, GKJ∗05].”
Level set discrete element method for three-dimensional computations with triaxial case study (2016, background): “…scale with increased grid resolution is and relatively low compared to that of polyhedral or NURBS-based methods as contact detection does not require traversal a tree of bounding volumes (Ericson, 2004; Lim et al., 2014) but rather is constant and only requires a lookup of values at grid points.”
Optimal polyhedral description of 3D polycrystals: Method and application to statistical and synchrotron X-ray diffraction data (2018, methodology): “This definition of the distance function both ensures that the distance at a particular location of a grain boundary is taken into account only once and makes it possible to use the standard GJK algorithm [58,59].”
Keep It SMPL: Automatic Estimation of 3D Human Pose and Shape from a Single Image (2016, methodology): “In graphics it is common to use proxy geometries to compute collisions eﬃciently [10,50].”
FCL: A general purpose library for collision and proximity queries (2012, methodology): “The problems of collision detection and distance computations are well studied [6], [7], [16].”
Motion planning with sequential convex optimization and convex collision checking (2014, methodology): “…shapes, is deﬁned analogously as the minimum translation that takes two shapes out of contact: The signed distance is deﬁned as follows: Note that these concepts can also be deﬁned using the notion of a conﬁguration space obstacle and the Minkowski difference between the shapes—see e.g. [13].”