{'fraction_non_alphanumeric': 0.01517706576728499, 'fraction_numerical': 0.0, 'mean_word_length': 5.941520467836257, '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 Occlusion Culling with Occupancy Proportion

Visibility culling is a fundamental problem in computer graphics. By combining object-space coherence with image-space coherence, this paper presents a novel algorithm for speeding up complex models rendering. The algorithm is based on the new concept of occupancy proportion (OP), which offers a simple, fast and efficient approach to visibility culling. We exploit the hardware accelerator character, and proposed an asynchronous occlusion queries method which significantly alleviates the affection caused by occlusion queries latency. The algorithm utilizes a hierarchy tree structure containing objects in the scene. The method in the paper can be easily integrated into majority visibility culling algorithms. The algorithm benefits for estimating object visibility and improves the efficiency of object visibility determination. Methodology and implementation details are provided, and experimental results demonstrate that the algorithm can obtain higher rendering efficiency than conservative object bounding box occlusion query method. The algorithm is suited for arbitrary structure scenes especially for slender scenes.