{'fraction_non_alphanumeric': 0.013084112149532711, 'fraction_numerical': 0.0, 'mean_word_length': 5.69375, '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}}
Efficient parallel recursive voxelization for SGI Challenge multi-processor system

Recursive algorithms are generally not straightforward to be processed in parallel, particularly when an octree is involved. Some researchers have tried to process an octree in parallel, but this solution is restricted to recursive subdivision methods that guarantee surface containment in an octant. We show a whole class of recursive subdivision algorithms which does not fall into this category. Our approach solves this problem, accepting any kind of spatial recursive subdivision algorithm, by accessing and creating the octree serially, while the subdivision process is done in parallel. Thanks to our efficient octree generation algorithm, its access and creation times are meaningless in comparison to the subdivision process. We further show that our solution gives excellent results to the problem of surface voxelization using spatial recursive subdivision. The method can be also successfully applied to other computer intensive problems using spatial recursive subdivision.