Our operational research approach determines the optimal paths as basic feasible solutions of a linear programming problem.
Each type of an elementary step has a uniquely defined weight.
The variables are the used numbers of the elementary steps. The co-ordinates of the end pixel of the path give the right-hand side of the model. In the LP model the starting pixel is the Origin, that is a triangle of the grid having co-ordinates (0, 0, 0). A new method to compute the chamfer distances based on linear optimization is presented. Chamfer distances on the isometric grid are considered.
0 kommentar(er)
