{'fraction_non_alphanumeric': 0.01751592356687898, 'fraction_numerical': 0.0, 'mean_word_length': 5.29, '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}}
Resolving Non-Binary Cyclic Occlusions with Image Compositing

Given an occlusion graph for a group of objects that contains no binary cycles, and a set of antialiased images with transparency for each of the (isolated) objects, image compositing operators can be used to produce a correct, antialiased image of the objects with hidden surfaces eliminated. We show how an appropriate image compositing expression is derived given the occlusion graph, and how the resulting expression can be put in canonical form so as to require only two image registers for evaluation, or alternately, three registers for efficient evaluation.