Hierarchical elimination selection method of dendritic river network generalization

Abstract

Dendritic river networks are fundamental elements in cartography, and the generalization of these river networks directly influences the quality of cartographic generalization. Automatic selection is a difficult and important process for river generalization that requires the consideration of semantic, geometric, topological, and structural characteristics. However, owing to a lack of effective use of river features, most existing methods lose important spatial distribution characteristics of rivers, thus affecting the selection result. Therefore, a hierarchical elimination selection method of dendritic river networks is proposed that consists of three steps. First, a directed topology tree (DTT) is investigated to realize the organization of river data and the intelligent identification of river structures. Second, based on the "180° hypothesis" and "acute angle hypothesis", each river is traced in the upstream direction from its estuary to create the stroke connections of dendritic river networks based on a consideration of the river semantics, length, and angle features, and the hierarchical relationships of a dendritic river network are then determined. Finally, by determining the total number of selected rivers, a hierarchical elimination algorithm that accounts for density differences is proposed. The reliability of the proposed method was verified using sample data tests, and the rationality and validity of the method were demonstrated in experiments using actual data.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 17 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.