from
Exact geodesic for triangular meshes
by Danil Kirsanov
Geodesic (shortest path) algorithm for triangular mesh (triangulated 2D surface in 3D).
|
| geodesic_new_algorithm(mesh, type, subdivision)
|
function algorithm = geodesic_new_algorithm(mesh, type, subdivision)
global geodesic_library;
algorithm = [];
if ~libisloaded(geodesic_library)
disp('error: geodesic library is not loaded');
return;
end
if nargin == 2
subdivision = 0;
end
if strcmp(type, 'subdivision') & subdivision == 0
type = 'dijkstra';
end;
algorithm_types = {'exact', 'subdivision', 'dijkstra'};
type_id = find(strcmp(type, algorithm_types));
if isempty(type_id)
disp('error: algorithm type is incorrect');
return;
end
type_id = type_id - 1;
algorithm.id = calllib(geodesic_library, 'new_algorithm', mesh.id, type_id, subdivision);
algorithm.type = type;
algorithm.object_type = 'algorithm';
|
|
Contact us at files@mathworks.com