کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
507899 865152 2013 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Multi-tree Coding Method (MCM) for drainage networks supporting high-efficient search
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
Multi-tree Coding Method (MCM) for drainage networks supporting high-efficient search
چکیده انگلیسی

River coding method for drainage networks plays an very important role in the physical simulation of river basins. In this study we developed a new river coding method named Multi-tree Coding Method (MCM), which has the following features: (1) it is established on a topological pattern reflecting the dendriform structure of drainage networks; (2) the multi-tree code can be effectively managed by the database to perform convenient topological search toward drainage networks using Structured Query Language (SQL); (3) the multi-tree code does not exhibit digital overflow problems in the computer, thus any resolution and scale drainage networks can easily be coded; and (4) it supports high-efficient search process. A river reach can be directly positioned in a drainage network under MCM, without the complex search process from all river reaches. This feature has great potential to improve the computational performance of basin models. We demonstrate here the efficiency and practicality of MCM by testing it in the Yalu Tsangpo river basin, Tibet. A drainage network with 140,745 digital reaches was extracted from the digital elevation model (DEM), and the multi-tree codes of all river reaches were obtained.


► A new river coding method, named Multi-tree Coding Method (MCM) is realized.
► MCM is applicable for any resolution and scale drainage networks.
► A reach can be directly positioned in drainage networks, without searching by MCM.
► MCM has great potential to enhance the computational efficiency for river basins.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Geosciences - Volume 52, March 2013, Pages 300–306
نویسندگان
, , ,