{'fraction_non_alphanumeric': 0.009283819628647215, 'fraction_numerical': 0.0, 'mean_word_length': 4.94488188976378, '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 data dependent triangulation for vector fields

The article deals with dependencies of a piecewise linear vector field and the triangulation of the domain. It shows that the topology of the field may depend on the triangulation and gives a suitable choice to obtain a simple topology by changes of the triangulation. The main point is the appearance of pairs of critical points with positive and negative Poincare index. Many of these occurrences can be avoided by changing the grid. This is proved in the article. An algorithm is presented which uses these results to extract simpler topological skeletons than usual methods. Finally there are several examples comparing these algorithms to demonstrate the effects of the data dependent triangulation.