{'fraction_non_alphanumeric': 0.014285714285714285, 'fraction_numerical': 0.0, 'mean_word_length': 5.040229885057471, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A fast growth distance algorithm for incremental motions

A fast algorithm is presented for computing the growth distance between a pair of convex objects in three-dimensional space. The growth distance is a measure of both separation and penetration between objects. When the objects are polytopes represented by their faces, the growth distance is determined by the solution of a linear program (LP). The article presents an approach to the solution of the LP. Under appropriate conditions, the computational time is very small and does not depend on the total number of faces of the objects. Compared to the existing algorithm for growth distance, there is a time reduction of several orders of magnitude. This increase in speed is achieved by exploiting two resources: adjacency of the object faces and the computational coherence induced by incremental motions of the objects, Computational experiments show that the performance of the algorithm is in the same range as the fastest codes for the computation of the Euclidean separation distance.