A fast procedure for computing incremental growth distances

A fast numerical procedure is presented for computing growth distances between a pair of polytopes in R/sup 3/ that move incrementally along specified smooth paths. The procedure carries out the growth distance evaluations efficiently by predicting and verifying contact configurations between a pair of grown polytopes. The computation time, in average, is very small and does not depend significantly on the geometric complexity of two polytopes.