{'fraction_non_alphanumeric': 0.015789473684210527, 'fraction_numerical': 0.012280701754385965, 'mean_word_length': 5.344444444444444, '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}}
Computation of a penetration measure between 3D convex polyhedral objects for collision detection

Measures to characterize the penetration between a pair of intersecting objects are given, based on translating one object to separate from the other. Algorithms to compute a measure between convex polyhedral objects in ℜ3 are presented for two different input representations. These algorithms have linear expected running time. Details of experiments in collision detection for 3D objects using the penetration measure are also presented. © 2001 John Wiley & Sons, Inc.