Efficient Algorithms for Geographic Watershed Analysis
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Efficient Algorithms for Geographic Watershed Analysis
Published Date
2012-07-03
Publisher
Type
Other
Abstract
This project is to analyze where wetlands and other vegetated buffers can be placed on the landscape to intercept drain waters and help purify them before they reach the natural watershed. The computational problem comes because new LIDAR images have expanded the resolution of geographic digital elevation models (DEMs) up to a thousandfold or more. This in turn has taxed the ability of existing algorithms to process the expanded datasets. Here we explain the project and present new efficient algorithms for parallel and scalar processing that reduce run-times from days on ordinary computers to minutes or second using the new algorithms in a parallel supercomputing environment.
Description
poster presented at the MSI 2012 Research Exhibition
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Minnesota Supercomputing Institute
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Barnes, Richard; Lehman, Clarence; Mulla, David; Galzki, Jacob; Wan, Haibo; Nelson, Joel. (2012). Efficient Algorithms for Geographic Watershed Analysis. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/126871.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.