Determining directional contact range of two convex polyhedra

  • Authors:

  • Yi-King Choi;Xueqing Li;Fengguang Rong;Wenping Wang;Stephen Cameron

  • Affiliations:

  • The University of Hong Kong, Hong Kong, China;Shandong University, Shandong, China;Shandong University, Shandong, China;The University of Hong Kong, Hong Kong, China;Oxford University Computing Laboratory, Oxford, U.K.

  • Venue:
  • GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The directional contact range of two convex polyhedra is the range of positions that one of the polyhedron may locate along a given straight line so that the two polyhedra are in collision. Using the contact range, one can quickly classify the positions along a line for a polyhedron as "safe" for free of collision with another polyhedron, or "unsafe" for the otherwise. This kind of contact detection between two objects is important in CAD, computer graphics and robotics applications. In this paper we propose a robust and efficient computation scheme to determine the directional contact range of two polyhedra. We consider the problem in its dual equivalence by studying the Minkowski difference of the two polyhedra under a duality transformation. The algorithm requires the construction of only a subset of the faces of the Minkowski difference, and resolves the directional range efficiently. It also computes the contact configurations when the boundaries of the polyhedra are in contact.