{'fraction_non_alphanumeric': 0.020522388059701493, 'fraction_numerical': 0.0, 'mean_word_length': 5.884615384615385, '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 and Robust GJK Implementation for Collision Detection of Convex Objects

Abstract This paper presents an implementation of the Gilbert-Johnson-Keerthi algorithm for comput ing the distance between convex objects, that has improved performance, robustness, and versatility over earlier implementations. The algorithm presented here is especially suitable for use in collision detection of objects modeled using various types of geometric primitives, such as boxes, cones, and spheres, and their images under affine transformation.