perform_fmstar_2d.m.svn-base

来自「fast marching method」· SVN-BASE 代码 · 共 22 行

function [D,S] = perform_fmstar_2d(W, start_points,end_points, options)

% perform_fmstar_2d - launch the Fast Marching* algorithm.
%
%   [D,S] = perform_fmstar_2d(W, start_points,end_points, options)
%
%   'W' is the weight matrix (the highest, the slowest the front will move).
%   'start_points' is a 2 x k array, start_points(:,i) is the ith starting point .
%   'end_points' is a 2 x 1 array, it is the goal.
%
%   'options' is a structure that can contains the following fields: 
%       * 'heuristic': the value for the 'distance to goal' heuristic 
%           (should be of the same size as W)
%       * 'heuristic_type': if you do not provide explicitly the heuristic,
%           it can be computed automatically, and the way to compute
%           it are set by 'heuristic_type' (either 'multiresolution'
%           or 'landmarks')
%   'reduc_factor' is the reduction factor for the coarse scale
%       computation (eg. 0.5 will perform the heuristic computation
%       on a grid of half size).
%
%   Copyright (c) 2004 Gabriel Peyr