{'fraction_non_alphanumeric': 0.01730103806228374, 'fraction_numerical': 0.0034602076124567475, 'mean_word_length': 5.027777777777778, '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}}
The Generalization Based on 3 Dimensional Douglas-Peucker Algorithm in New DEM Model

Since different applications have different requests, an already generated DEM does not always suit all the demands of an application. The objective of DEM generalization is the generation of a smooth surface with a lower resolution than the original data, which should preserve topographic features and be appropriate for a smaller scale relief presentation. In this paper, we take a new algorithm-3 dimensional Douglas-Peucker algorithm in DEM generalization, which is effective in data compression as in 2 dimensional form. Our test is based on a new DEM model, which is aimed to generate DEMs with high qualities. A case study is put forward to give the detail explanation. Meantime, its feasibility is described from elevation range and contours derived from generalized DEMs.