(C++) Orthogonal Least Cost Path
Computes an orthogonal least-cost path within a cost matrix. Each steps within the least-cost path either moves in the x or the y direction, but never diagonally.
cost_path_orthogonal_cpp(dist_matrix, cost_matrix)
dist_matrix
: (required, numeric matrix). Distance matrix between two time series.cost_matrix
: (required, numeric matrix). Cost matrix generated from dist_matrix
.data frame
#simulate two time series x <- zoo_simulate(seed = 1) y <- zoo_simulate(seed = 2) #distance matrix dist_matrix <- distance_matrix_cpp( x = x, y = y, distance = "euclidean" ) #least cost matrix cost_matrix <- cost_matrix_orthogonal_cpp( dist_matrix = dist_matrix ) #least cost path cost_path <- cost_path_orthogonal_cpp( dist_matrix = dist_matrix, cost_matrix = cost_matrix ) cost_path
Other Rcpp_cost_path: cost_path_cpp()
, cost_path_diagonal_bandwidth_cpp()
, cost_path_diagonal_cpp()
, cost_path_orthogonal_bandwidth_cpp()
, cost_path_slotting_cpp()
, cost_path_sum_cpp()
, cost_path_trim_cpp()