Exact geodesic for triangular meshes: geodesic_trace_back(algorithm, destination) - File Exchange

Code covered by the BSD License

Highlights from
Exact geodesic for triangular meshes

create_flat_triangular_mesh(s... good mesh to catch possible bugs in geodesic algorithms
create_hedgehog_mesh(N, smoot... "smoothness" should be specified between 0(smooth, convex mesh) and 1 (a lot of sharp features)
create_subdivision_pattern(le... regular subdivision pattern of a triangle
extract_coordinates_from_path... this elegant way is incompatible with the older versions of matlab
geodesic_best_source(algorith... finds best source and distance to the best source
geodesic_convert_surface_poin... internal geodesic function
geodesic_create_surface_point...
geodesic_delete(object) delete mesh, algorithm, or everything at once
geodesic_new_algorithm(mesh, ...
geodesic_new_mesh(points, tri...
geodesic_propagate(algorithm,...
geodesic_trace_back(algorithm...
example1.m
example2.m
example3.m
example4.m
example5.m
View all files

from Exact geodesic for triangular meshes by Danil Kirsanov
Geodesic (shortest path) algorithm for triangular mesh (triangulated 2D surface in 3D).

geodesic_trace_back(algorithm, destination)

function path = geodesic_trace_back(algorithm, destination)

global geodesic_library;

tmp{1} = destination;
d = geodesic_convert_surface_points(tmp);

tmp = libpointer('doublePtrPtr');
[path_length, tmp, path_double] = calllib(geodesic_library, 'trace_back', algorithm.id, d, tmp);

setdatatype(path_double, 'doublePtr', path_length*5);
path = geodesic_convert_surface_points(path_double.Value);

Highlights from Exact geodesic for triangular meshes

Highlights from
Exact geodesic for triangular meshes