Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 1990 | Published
Book Section - Chapter Open

Geometric collisions for time-dependent parametric surfaces

Abstract

We develop an algorithm to detect geometric collisions between pairs of time-dependent parametric surfaces. The algorithm works on surfaces that are continuous and have bounded derivatives, and includes objects that move or deform as a function of time. The algorithm numerically solves for the parametric values corresponding to coincident points and near-misses between the surfaces of two parametric functions.Upper bounds on the parametric derivatives make it possible to guarantee the successful detection of collisions and near-misses; we describe a method to find the derivative bounds for many surface types. To compute collisions between new types of surfaces, the mathematical collision analysis is needed only once per surface type, rather than analyzing for each pair of surface types.The algorithm is hierarchical, first finding potential collisions over large volumes, and then refining the solution to smaller volumes. The user may specify the desired accuracy of the solution. A C-code implementation is described, with results for several non-bicubic and bicubic time-dependent parametric functions. An animation of the collision computation demonstrates collisions between complex parametric functions.

Additional Information

© 1990 ACM. We would like to thank Carolyn Collins and Pete Wenzel for their assistance. The work presented in this paper was sponsored in part by International Business Machines, Inc., Hewlett-Packard Co., Apple Computer, Inc., and the Fannie and John Hertz Foundation.

Attached Files

Published - p39-von_herzen.pdf

Files

p39-von_herzen.pdf
Files (2.8 MB)
Name Size Download all
md5:00c2f2c9b3931613ff80bbfed7b18ebf
2.8 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 23, 2023