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 …

In this paper, we survey the state of the art in collision detection between general geometric
models. The set of models include polygonal objects, spline or algebraic surfaces, CSG …

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 …

In a geometric context, a collision or proximity query reports information about the relative
configuration or placement of two objects. Some of the common examples of such queries …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

We present a framework for fast and accurate collision detection for haptic interaction with
polygonal models. Given a model, we pre-compute a hybrid hierarchical representation …

Fast and accurate collision detection between general geometric models is a fundamental
problem in modeling, robotics, manufacturing and computer-simulated environments. Most …

In this paper, we provide the theoretical foundation and an effective algorithm for localizing
topological attributes such as tunnels and voids. Unlike previous work that focused on 2 …

Fast and accurate collision detection between general solid models is a fundamental
problem in solid modeling, robotics, animation and computer-simulated environments. Most …

We present a fast implementation of a hybrid algorithm for reporting box and cube
intersections. Our algorithm initially takes a divide-and-conquer approach and switches to …