findpathinnng.m

来自「beamlet变化的工具箱」· M 代码 · 共 28 行

%  FindPathInNNG -- Find the minimum distance path in the near neighbour graph
%   Usage
%     [Path,dist] = FindPathInNNG(v0,v1,n);
%   Inputs
%     v0,v1    start and end vertices
%     n        extent of image
%   Outputs
%     Path     the minimum distance path in the near neighbour graph,
%              always from v0 to v1.
%     dist     the length of the path
%   Description
%     Bresenham's algorithm
%  
%
%
% Part of BeamLab Version:200
% Built:Friday,23-Aug-2002 00:00:00
% This is Copyrighted Material
% For Copying permissions see COPYING.m
% Comments? e-mail [e-mail]
%
%
% Part of BeamLab Version:200
% Built:Saturday,14-Sep-2002 00:00:00
% This is Copyrighted Material
% For Copying permissions see COPYING.m
% Comments? e-mail [e-mail]
%