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.
Value
$leastcostchain
The complete matrix used to solve the minimization.
$chainpath
The sequence of consecutive nodes representing the path.
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.