{'fraction_non_alphanumeric': 0.02109704641350211, 'fraction_numerical': 0.0, 'mean_word_length': 5.414414414414415, '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 New Triangulation Algorithm Based on the Determination of the Polygon's Diagonals

This paper presents a triangulation algorithm for the general plane polygon, this algorithm does not consider the polygon's concave or convex and its vertices are clockwise or counter clockwise. It first makes the elimination marks for the diagonals outside of the polygon, then determines the diagonals which intersect with the polygon and makes the elimination marks. In order to avoid the long and narrow triangles we use CDT algorithm to eliminate the inapposite diagonals. Lastly, we draw the remaining diagonals. So we finish the process of triangulation. Keywords-component; polygon; diagonal; triangulations; algorithm