GetMinMap: Gets least-distance mapping among the minimum-area mappings.

In pathmapping: Compute Deviation and Correspondence Between Spatial Paths

Description

Finds minimum linear-distance mapping among the least-cost area-based mappings between paths.

Usage

GetMinMap(mapping, leftbias=T, verbose = F )

Arguments

mapping	An object computed via CreateMap()
leftbias	Boolean value determining whether to prefer left or upper node connections first.
verbose	Whether intermediate output should be printed.

Details

GetMinMap() finds the best mapping between two paths amongst those that have the smallest area-based dissimilarity. It adds several data structures to a mapping produced by CreateMap: $leastcostchain and $chainpath, and it sets the boolian $minmap from FALSE to TRUE.

Value

$leastcostchain	The complete matrix used to solve the minimization.
$chainpath	The sequence of consecutive nodes representing the path.

Author(s)

Shane T. Mueller and Brandon Perelman

References

See Mueller et al., (2016). https://sites.google.com/a/mtu.edu/mapping/

See Also

See Also CreateMap,

pathmapping documentation built on May 2, 2019, 4:20 a.m.