{'fraction_non_alphanumeric': 0.014056224899598393, 'fraction_numerical': 0.002008032128514056, 'mean_word_length': 5.2375, '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}}
Ray tracing by Dijkstra algorithm for complicated structures

This paper is concerned with ray tracing by Dijkstra algorithm (DA) to treat complicated structures. Computational spaces are divided in terms of regularly arrayed nodes. Boundary nodes are composed of combinations of 8 cubes and they are categorized according to optical properties. Links are designated to each categorized node to reduce computation time. Some numerical examples are shown for a Gaussian type of random rough surface.