{'fraction_non_alphanumeric': 0.022007042253521125, 'fraction_numerical': 0.0008802816901408451, 'mean_word_length': 5.247252747252747, '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}}
First Order Approximation for Texture Filtering

Texture mapping is a core technique in 3D graphics and is important for computer vision applications as well. The major challenge of texture mapping is high quality antialiasing at a reasonably high speed. Previous approaches do not address this problem adequately, since they do not precisely model the anisotropic and spatially variant nature in texture mapping. In this paper, we handle this problem using signal processing and sampling theory. We first describe an analytic framework to deduce the ideal filter and the corresponding weight distribution for texture filtering. Since the ideal filter does not have a closed-form solution, we further propose a filter that is the first order, yet of high precision, approximation of the ideal filter and makes a closed-form solution possible. This first order approximating (FOA) filter has excellent anti-aliasing capability and a reasonably high rendering speed. The comparison with some wellknown filters (box, cubic, EWA, and fast footprint MIPmapping, etc.) also testifies that our filter does have better antialiasing performance.