{'fraction_non_alphanumeric': 0.020463847203274217, 'fraction_numerical': 0.0, 'mean_word_length': 5.066115702479339, '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 constant-time algorithm for computing the Euclidean Distance Transform on reconfigurable meshes

The Euclidean Distance Transform (EDT) is a basic operation in computer vision, pattern recognition, and robotics. Fast computation of the EDT is needed since most of the applications using the EDT requires real-time computation. The authors propose a new and fast parallel algorithms for computing the EDT problem on the reconfigurable VLSI mesh model. It is shown that the VLSI complexity of the algorithm described is the same as those of other sequential algorithms and the mesh algorithm, while it uses much less time. To authors' best knowledge, this is the first constant-time EDT algorithm on any parallel computational model.