{'fraction_non_alphanumeric': 0.04187604690117253, 'fraction_numerical': 0.0, 'mean_word_length': 4.339285714285714, '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}}
Computing Maximal Islands

Given a set S of red and blue points on the plane in general position, an island I(S, C) ⊆ S is the intersection of S and a convex region C. We study the problem of finding a maximal island according to certain criterium. For instance, a largest monochromatic island I(S, C) is a maximum cardinality subset of S, such that every point of I(S, C) belongs to the same chromatic class. An O(n)-time and O(n)-space algorithm is proposed to find one such subset. Our approach can be adapted to find monochromatic islands which maximize parameters such as the area, perimeter.