Blogs about: Mfworks
Featured Blog
17 Shortest Path I+II
Now, the shortest path(s) can be extracted as follows: ShortestPath_time2 = Recode ShortestPath4_InNetwork_time2 Assigning 999 To 83…85 ; For time interval 1, first add proximity surfaces, then … more →
MFWorks
01 MFworks
Jan wrote 2 years ago: These pages will explain how to do network analysis in raster GIS using MFworks as an example softwa … more →
MFworks Tutorial
Jan wrote 8 years ago: MFworks has evolved from MAPFactory, originally designed by C. Dana Tomlin, the father of map algebr … more →
How to make a straight line square
Jan wrote 9 years ago: Network analysis and least cost paths have long been the dominion of vector GIS. The research of thi … more →
02 Network Modelling
Jan wrote 2 years ago: The key to producing a successful network model is in understanding the relationship between the cha … more →
03 Incremental Linkage
Jan wrote 2 years ago: This operation infers the lineal characteristic of raster cells, by equating consecutive locations w … more →
04 Directional Identifier
Jan wrote 2 years ago: The second step to creating a road network in raster GIS is to impose constraints on the flow that c … more →
05 Cost surface
Jan wrote 2 years ago: Usually, to generate a cost-of passage surface, several variables will be collapsed into one layer. … more →
06 Travel cost - path length
Jan wrote 2 years ago: To determine the actual length of a path through a number of cells the Incremental Length operation … more →
07 Dynamic Cost Surface
Jan wrote 2 years ago: One option for implementing a dynamic cost surface is to use a continuously updated network, where t … more →
08 Artefacts
Jan wrote 2 years ago: Accuracy Using raster GIS for network analysis leads into a simplification of a complex network stru … more →
09 Map Layers Needed
Jan wrote 2 years ago: Map layers needed: A network, a cost surface, origin and destination point, network.mfm costoftravel … more →
10 Deriving Linkage
Jan wrote 2 years ago: linkage = IncrementalLinkage network; The Linkage operation assigns values indicating how cells are … more →
11 Deriving Directions
Jan wrote 2 years ago: This operation converts linkage values into directional values. direction_raw = Recode linkage Assig … more →
12 Deriving the Shortest Path
Jan wrote 2 years ago: Creating proximity surfaces from origin and destination and adding them yields the shortest path. Sp … more →
13 Viewing the Shortest Path
Jan wrote 2 years ago: Now, the shortest path can be extracted. ShortestPath = Recode ShortestPath_InNetwork Assigning 999 … more →
14 Dynamic Networks
Jan wrote 2 years ago: The procedure is similar to finding the shortest path through a network with no time-dependent trave … more →
15 Shortest Path I
Jan wrote 2 years ago: The procedure is similar to finding the shortest path through a network with no time-dependent trave … more →
16 Shortest Path II
Jan wrote 2 years ago: Creating proximity surfaces for path(s) in time interval 2 and adding these together yield the short … more →
17 Shortest Path I+II
Jan wrote 2 years ago: Now, the shortest path(s) can be extracted as follows: ShortestPath_time2 = Recode ShortestPath4_InN … more →
