{'fraction_non_alphanumeric': 0.020172910662824207, 'fraction_numerical': 0.0, 'mean_word_length': 5.556603773584905, '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}}
Improvement in the Cohen-Sutherland line segment clipping algorithm

Cohen-Sutherland clipping algorithm may produce the invalid intersection points, which will reduce the efficiency of the whole algorithm. To avoid the shortcoming, this paper has put forward an improved algorithm based on Cohen-Sutherland algorithm. Given a line segment, by the coordinate values of clipping window vertexes and the implicit equation of the line segment, the improved algorithm can rapidly judge which clipping window edge has real intersection point(s) with the line segment. Experiments show that the improved algorithm is more efficient than other improved Cohen-Sutherland algorithms in reference papers.