{'fraction_non_alphanumeric': 0.018421052631578946, 'fraction_numerical': 0.0013157894736842105, 'mean_word_length': 5.186991869918699, '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 Linear Algorithm of Spatial Straightness for Five Points

It is a non-linear problem to evaluate the minimum zone spatial (3-D) straightness. Because of the disadvantages of evaluating spatial straightness error with traditional method, such as difficulty in solving the non-linear equation, the evaluating precision is lower. This paper develops a solution that can transform the non-linear problem into a linear problem. The solution can obtain more exact results than traditional method using results of LSC as initial conditions. This methodology can also be applied to the problems of computing the minimum circumscribed cylinder and the maximum inscribed cylinder. The effectiveness and efficiency of the novel approach are illustrated by two examples.