HOMEABOUTPEOPLEPROJECTSPUBLICATIONSHISTORYIMAGES gdc

Minimum Distance Computations


Goal

Our goal is to efficiently compute the minimum distance between complex models. This work was motivated by a collaborative Virtual Prototyping Project, where we need to predict possible contact between a virtual arm and mechanical assemblies. Most current work on minimum distance focuses on polyhedral and often convex models; we wish to extend this to include sculptured CAD models.

Approach

Our approach is based on a hierarchy of bounding volumes around the model. Portions of the hierarchy may be quickly pruned by establishing an upper bound on the minimum distance to the model and a lower bound on the minimum distance between the model geometries contained by the bounding volumes. We have investigated different bounding volumes, different tree traversal methods, as well as the efficiency of different model representations.

At a lower level, we are investigating ways of tracking the closest point on a sculptured surface at very high rates. These high speed methods are suitable for the 1000Hz rates needed for haptic interfaces. We show various means of obtaining these rates with speed-accuracy tradeoffs. In addition, we have analyzed the stability of these methods.

Participants

Publications



Support

Support for this research was provided by NSF Grant MIP-9420352, by DARPA grant F33615-96-C-5621, and by the NSF and DARPA Science and Technology Center for Computer Graphics and Scientific Visualization (ASC-89-20219).



gdc-web@cs.utah.edu
Last update: September 21, 2000