{'fraction_non_alphanumeric': 0.006980802792321117, 'fraction_numerical': 0.0017452006980802793, 'mean_word_length': 5.5227272727272725, '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}}
Computation of the Bernstein Coeecients on Subdivided Triangles

We present a procedure for computing the coeecients of the expansion of a bivariate polynomial into Bernstein polynomials over subtriangles. These triangles are generated by partitioning the standard simplex of IR 2. The coeecients are computed directly from the coeecients on the subdivided triangle from the preceding subdivision level. This allows a recursive computation of the coeecients and facilitates the economical computation of bounds for the range of a bivariate polynomial over a given triangle.