Fast and Simple 2D Geometric Proximity Queries Using Graphics Hardware
Kenneth E. Hoff III, Andrew Zaferakis, Ming C. Lin, Dinesh Manocha
Symposium on Interactive 3D Graphics, March 2001, pp. 145--148.
Abstract: We present a new approach for computing generalized proximity information of arbitrary 2D objects using graphics hardware. Using multi-pass 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 image-based approach balances computation between the CPU and graphics subsystems. Geometric object-space techniques coarsely localize potential intersection regions or closest features between two objects, and image-space techniques compute the low-level 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 variety of simulation strategies for both backtracking and penalty-based collision responses.
Keyword(s): Proximity queries, collision detection, penetration depth, graphics hardware acceleration, multi-pass techniques
@inproceedings{Hoff:2001:FAS,
author = {Kenneth E. Hoff III and Andrew Zaferakis and Ming C. Lin and Dinesh Manocha},
title = {Fast and Simple 2D Geometric Proximity Queries Using Graphics Hardware},
booktitle = {Symposium on Interactive 3D Graphics},
pages = {145--148},
month = mar,
year = {2001},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."