📄 perform_circular_fast_marching_2d.m.svn-base
字号:
function [D,S] = perform_circular_fast_marching_2d(W, start_points, center_point, options, H)
% perform_circular_fast_marching_2d - launch the Fast Marching algorithm for circular propagation.
%
% [D,S] = perform_circular_fast_marching_2d(W, start_points,center_point,options, H);
%
% '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 .
% 'center_point' is a 2 x k array, it is the center around the flow will turn.
%
% Optional:
% - You can provide special conditions for stop in options :
% 'options.end_points' : stop when these points are reached
% 'options.nb_iter_max' : stop when a given number of iterations is
% reached.
% - You can provide an heuristic (typically that try to guess the distance
% that remains from a given node to a given target).
% This is an array of same size as W.
%
% Copyright (c) 2004 Gabriel Peyr
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -