{'fraction_non_alphanumeric': 0.016592920353982302, 'fraction_numerical': 0.017699115044247787, 'mean_word_length': 4.323529411764706, '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}}
Shape's Related 3D Objects Indexing and Image Database Organization

The present paper considers the 3D shape as a sequence of 2D sections cut from the object. A part of the 2D sections (shapes) is essential for the 3D shape and the others are similar to the essential. Therefore a 3D object could be indexed through a sequence of 2D shapes, each of them coded by a numerical sequence with 4 parts. The 1st one describes the convex hull. The 2nd shows the number of 3rd and 4th level concavities. The 3rd and 4th parts are finite numerical sequences, describing the support of the convex set of the 2nd level concavity and the support of the 2nd level concavity. To comply with the sequence concept the image database is designed as a tree. The maximum number of leafs, the calculation complexity of the retrieval, and a comparison with methods close to the present one are given at the end of the paper.