{'fraction_non_alphanumeric': 0.03398692810457516, 'fraction_numerical': 0.00261437908496732, 'mean_word_length': 4.937984496124031, '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}}
A computational model for nonrational bisector surfaces: curve-surface and surface-surface bisectors

The bisector of two rational surfaces in R/sup 3/ is, in general, nonrational; and so is the bisector of a rational curve and a rational surface. Thus, bisector surfaces in these two cases must be approximated numerically. Unfortunately, they are algebraic surfaces of very high degree and numerical approximation is non-trivial. This paper suggests a new computational model for constructing curve-surface and surface-surface bisectors in R/sup 3/. The curve-surface bisector problem is reformulated as the search for a trivariate zero-set; and the surface-surface bisector problem is reduced to that of finding the common zero-set of two four-variate functions.