Modeling Flow

1
Modeling Flow

• FE423 - February 17, 2000

2
Labs

• Good news Logging related
• Bad news Extra reading
• Slow code

3
Outline

• Euclidean Distance
• Cost Distance

4
Euclidean Distance

• Shortest distance from the source cells to each
  cell in a grid

5
Euclidean Distance

• Shortest distance from the source cells to each
  cell in a grid
• Example

6
Euclidean Direction

• Angle from each cell in a grid to the source
  cells
• There may be some use for this

7
Euclidean Allocation

• Identified the nearest source cells for each
  cell in a grid

8
Euclidean Weighted 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.

9
Euclidean Back-link Direction

• The direction to the adjacent cell that leads
  back to the source grid
• Does this remind you of anything?

10
Euclidean Cost Allocation

• The cost grid changes which source area is closest

11
Euclidean Weighted Distance

• The cost from moving from one cell to a
  neighbor is the average of the two values