Efficient Contact Determination Between Geometric Models

Abstract

The problem of interference detection or contact determination between two or more objects in dynamic environment is fundamental in computer graphics, robotics, and virtual environments. Most of the earlier work is restricted to either polyhedral models or static environments. In this paper, we present efficient algorithms for contact determination and interference detection between geometric models undergoing rigid motion. The set of models include polyhedra and surfaces described by algebraic sets or piecewise algebraic functions. The algorithms make use of temporal and spatial coherence between successive instances and their running time is a function of the motion between successive instances. The main characteristics of these algorithms are their simplicity and efficiency. They have been implemented; their performance on many applications indicates their potential for real-time simulations. Contact determination, Collision detection, Visual simulations, Animation, Robotics, Geometric models, Coherence, Voronoi regions, Closest features and points.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 08, 1994
Accession Number
ADA280244

Entities

People

  • Dinesh Manocha
  • Ming C. Lin

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms
  • Autonomy

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • California
  • Classification
  • Computational Complexity
  • Computational Science
  • Computer Graphics
  • Computer Science
  • Geometry
  • Graphics
  • Linear Programming
  • North Carolina
  • Relative Motion
  • Robotics
  • Simulations
  • Three Dimensional
  • Virtual Reality

Readers

  • Database Systems and Applications
  • Graph Algorithms and Convex Optimization.
  • Vision Science/Vision Psychology/Cognitive Neuroscience.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms
  • Autonomy