{'fraction_non_alphanumeric': 0.011294526498696786, 'fraction_numerical': 0.0, 'mean_word_length': 5.582857142857143, '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}}
Recursive Space Decompositions in Force-Directed Graph Drawing Algorithms

Force-directed graph drawing algorithms are a popular method of drawing graphs, but poor scalability makes them unsuitable for drawing large graphs. The FADE paradigm uses the proximity information in recursive space decompositions to address this problem and that of high visual complexity. The FADE paradigm has been presented with a simple and common recursive space decomposition known as the quadtree. However, quadtrees have the disadvantage of not being robust with respect to small perturbations and some transformations of the input data, and this can adversely affect the resultant graph drawing. This paper investigates the FADE paradigm using an alternative recursive space decomposition known as the recursive voronoi diagram, which avoids some of the problems found in quadtrees at an additional time complexity cost. Preliminary results with random graphs and graphs in the domain of software engineering are presented and suggest that using better recursive space decompositions has promise, but the additional computational effort may not be easily justified.