Computation of penetration measures for convex polygons and polyhedra for graphics applications

Abstract

Algorithms to compute measures of penetration between convex polygonal objects in /spl Rfr//sup 2/ and convex polyhedral objects in /spl Rfr//sup 3/ are presented. The algorithms are analyzed for their asymptotic complexity. Details of implementation on a single processor machine are given. Parallelization of the algorithms is discussed.