1 / 18

SCHEDULE

SCHEDULE. Discussion Problems. Revisiting the road-side ditch question: Water flows faster in ditches than through the soil. If you count the ditch segments that feed directly into streams as part of the stream network, then map the flow length to streams with and without road ditches.

babu
Download Presentation

SCHEDULE

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SCHEDULE

  2. Discussion Problems Revisiting the road-side ditch question: Water flows faster in ditches than through the soil. If you count the ditch segments that feed directly into streams as part of the stream network, then map the flow length to streams with and without road ditches. By how much is the average flowlength above a stream cell reduced by adding the roads?

  3. Practice Problem Identify FlowDirection for each cell (arrows are okay)

  4. Practice Problem Identify FlowAccumulation(nil)

  5. Practice Problem Identify streams as cells with >10 contributing cells

  6. Practice Problem identify flow distance to streams

  7. OUTLINE EUCLIDEAN: • distance • allocation • direction COST: • distance • allocation • back-direction

  8. Euclidean Distance • Shortest distance from the ‘source’ cells to each cell in a grid

  9. Euclidean Distance • Shortest distance from the ‘source’ cells to each cell in a grid • Example

  10. Euclidean Allocation • Identified the nearest ‘source’ cells for each cell in a grid

  11. Euclidean Direction • Angle from each cell in a grid to the ‘source’ cells • There may be some use for this

  12. Coding Euclidean Distance aGrid.EucDistance (directionFN, allocationFN, maxDistance) aGrid.EucAllocation (distanceFN, directionFN, maxDistance)

  13. Cost Distance • The ‘cost’ from moving from one cell to a neighbor is provides the cumulative cost of getting from each cell to the ‘source’ cell with the lowest travel cost to it.

  14. Cost Weighted Averaging • The ‘cost’ from moving from one cell to a neighbor is the average of the two values

  15. Cost Allocation • The cost grid changes which source area is closest

  16. Back-link Direction • The direction to the adjacent cell that leads back to the source grid • Does this remind you of anything?

  17. Coding Cost Distance aGrid.CostDistance (costGrid, directionFN, allocationFN, maxDistance) We won’t be getting into using files “…FN” in Avenue We can instead use hydrologic functions to get direction and thus routing.

  18. Discussion Problems We might use stream buffers to disperse sediment and runoff before it reaches the stream. How much larger will a 200’ Euclidean distance stream buffer be than a buffer that includes slopes that have a 200’ flowpath to the stream? How might we use the zonalstats function to quantify the area of each zone?

More Related