Toolbox Graph: perform_dijkstra_propagation.m - File Exchange

Code covered by the BSD License

Highlights from
Toolbox Graph

Toolbox graph - A toolbox to ...
Isomap(D,ndims,options); isomap - computes Isomap embedding using the algorithm of
adjacency2incidence(A) adjacency2incidence - convert an adjacency matrix to an incidence matrix
adjmatrix2list(A) adjmatrix2list - convert from matrix adjacency representation
boundary=compute_boundary(fac... compute_boundary - compute the vertices on the boundary of a 3D mesh
build_euclidean_weight_matrix... build_euclidean_weight_matrix - build a weighted adjacenty matrix
build_graph_from_image( M, co... build_graph_from_image - build a graph from an image.
check_face_vertex(vertex,face... check_face_vertex - check that vertices and faces have the correct size
check_incircle(vertex,face,po... check_incicle_edge - compute "empty circle" property for a set of faces
check_incircle_edge(vertex, f... check_incicle_edge - compute "empty circle" property for a set of edges
clamp(x,a,b)
compute_combinatorial_laplaci... compute_laplacian - return the combinatorial laplacian of a given adjacency matrix
compute_curvature(vertex,face... compute_curvature - compute principal curvature directions and values
compute_delaunay(vertex) compute_delaunay - compute faces of a Delaunay triangulation
compute_diffusion_geometry(T,... compute_diffusion_geometry - compute the diffusion geometry basis functions
compute_diffusion_kernel(A,no... compute_normalized_kernel - compute a diffusion kernel from a weight/adjacency matrix
compute_distance_graph(W, poi... compute the distance between each point on a graph
compute_dual_graph(face,verte... compute_dual_graph - compute the dual graph of a given triangulation
compute_edge_face_ring(face) compute_edge_face_ring - compute faces adjacent to each edge
compute_edges(face) compute_edges - from a list of faces, compute the list of (unique) edges.
compute_face_ring(face) compute_face_ring - compute the 1 ring of each face in a triangulation.
compute_geometric_laplacian(v... compute_geometric_laplacian - return a laplacian
compute_laplacian_curve(c,opt... compute_laplacian_curve - compute a 2D laplacian
compute_levelset_mesh(vertex,... compute_levelset_mesh - compute level set curve
compute_mesh_gradient(vertex,... compute_mesh_laplacian - compute a gradient matrix
compute_mesh_local_covariance... compute_mesh_local_covariance - compute the local covariance of a vector field
compute_mesh_weight(vertex,fa... compute_mesh_weight - compute a weight matrix
compute_mesh_weight(vertex,fa... compute_mesh_laplacian - compute a laplacian matrix
compute_normal(vertex,face) compute_normal - compute the normal of a triangulation
compute_orthocenter(vertex,fa... compute_orthocenter - compute the orthocenters of a triangulation
compute_orthoproj_triangulati... compute_orthoproj_triangulation - compute best approximation on a triangulation
compute_parameterization(vert... compute_parameterization - compute a planar parameterization
compute_rotation(v,alpha) compute the 3D rotation matrix around vector v
compute_semidual_graph(face, ... compute_semidual_graph - compute a half dual graph
compute_traveling_salesman(W,... compute_traveling_salesman - wrapper for the linkern programm solving TSP
compute_triangulation_angles(... compute_triangulation_angles - compute the vector of minimum angles
compute_vertex_face_ring(face) compute_vertex_face_ring - compute the faces adjacent to each vertex
compute_vertex_ring(face) compute_vertex_ring - compute the 1 ring of each vertex in a triangulation.
compute_voronoi_mesh(vertex,f... compute_voronoi_mesh - compute the exact voronoi segmentation of a 3D mesh
convert_gim2mesh(gim, sub_sam... convert_gim2mesh - convert a geometry image into a mesh
crop(M,n,c) crop - crop an image to reduce its size
getoptions(options, name, v, ... getoptions - retrieve options parameter
griddata_arbitrary(face,verte... griddata_arbitrary - perform interpolation of a triangulation on a regular grid
imageplot(M,str, a,b,c) imageplot - diplay an image and a title
incidence2adjacency(Ic) incidence2adjacency - convert an incidence matrix to an adjacency matrix
load_curve(name, n, options) load_curve - load a sample curve
load_gim(name, options) load_gim - load a geometry image, either from a file or synthetic.
load_graph(name,n,options) load_graph - load some graph
mesh_flip_faces(arg1, arg2, a...
mesh_previewer(file)
mesh_wrapper(vertex1,face1,ve... mesh_wrapper - calls the MESH software and parse the result
metro_wrapper(vertex1,face1, ... metro_wrapper - calls the metro software and parse the result
nb_dims(x) nb_dims - debugged version of ndims.
norme(x)
perform_analysis_regularizati... perform_analysis_regularization - perform a sparse regularization
perform_delaunay_flipping(ver... perform_delaunay_flipping - compute Dalaunay triangulation via flipping
perform_dijkstra(W, start_poi... perform_dijkstra - launch the Dikstra algorithm.
perform_dijkstra_path_extract... perform_dijkstra_path_extraction - extract a shortest path
perform_dijkstra_propagation_... dijkstra - Find shortest paths in graphs
perform_dijkstra_propagation_... perform_dijkstra_propagation_slow - Matlab implementation of Dijkstra algorithm.
perform_faces_reorientation(v... perform_faces_reorientation - reorient the faces with respect to the center of the mesh
perform_floyd_algorithm(D, ve... floyd - compute shortest distances on a
perform_lloyd_iteration(X,opt... perform_lloyd_iteration - perform lloyd smoothing
perform_mesh_heat_diffusion(v... perform_mesh_heat_diffusion - perform heat diffusion
perform_mesh_simplification(v... perform_mesh_simplification - simplify a 3D mesh
perform_mesh_smoothing(face,v... perform_mesh_smoothing - smooth a function defined on a mesh by averaging
perform_normal_displacement(v... perform_normal_displacement - perfrom a movement of rho in the normal direction
perform_point_picking( PointC... function perform_point_picking( PointCloud, face );
perform_saturation(x,tau,use_... perform_saturation - saturate a vector for better contrast
perform_triangle_flipping(fac... perform_triangle_flipping - apply a sequence of flips to a triangulation
plot_dijkstra(A, vertex, S, p... plot one state in dijkstra algorithm.
plot_edges(edges, vertex, col... plot_edges - plot a list of edges
plot_geometry_image(M, displa... plot_geometry_image - plot a geometry image
plot_graph(A,xy, options) plot_graph - display a 2D or 3D graph.
plot_mesh(vertex,face,options...
plot_silouhette(M, s_list, li... display
plot_spherical_triangulation(... plot_spherical_triangulation - display a nice spherical triangulation
progressbar(n,N,w) progressbar - display a progress bar
progressive_mesh(vertex,face,... progressive_mesh - generate a simplified mesh
publish_html(filename, output... publish_html - publish a file to HTML format
qslim(FV,varargin); QSLIM - Mesh simplification, wrapper function for Garland's QSLIM executable program
read_gim(filename)
read_mesh(file)
read_mfile(filename, type) read_mfile - read Hughe Hoppe .m file.
read_obj(filename)
read_off(filename) read_off - read data from OFF file.
read_ply(filename) read_ply - read data from PLY file.
read_smf(filename) read_smf - read data from SMF file.
read_tet(filename) read_tet - read data from TET file.
read_vtk(filename, verbose) read_vtk - read data from VTK file.
read_wrl(filename) read_wrl - load a mesh from a VRML file
rescale(x,a,b)
reverse_orientation(face) reverse_orientation - reverse the orientation
select3d(obj) SELECT3D(H) Determines the selected point in 3-D data space.
tet2tri(facet, vertex, keep_s... tet2tri - convert a tet mesh to a tri mesh
triangulate(nodes, boundary, ... triangulate - interface to 'triangle' library.
triangulation2adjacency(face,... triangulation2adjacency - compute the adjacency matrix
triangulation_isequal(face,fa... triangulation_isequal - true if two triangulations are equals
write_gim(M, filename, save_p...
write_mesh(file, vertex, face...
write_obj(filename, vertex, f... write_off - write a mesh to an OBJ file
write_off(filename, vertex, f...
write_ply(vertex,face,filenam... write_ply - write data to PLY file.
write_smf(filename, vertex, f...
write_wrl(filename, vertex, f... write_wrl - write a mesh to a VRML file
batch_levelsets_meshes.m
compile_mex.m
perform_dijkstra_propagation.m
test_compression.m
test_compression_fixed.m
test_constrained_delaunay.m
test_curvature.m
test_diffusion_wavelets.m
test_dijkstra.m
test_dijkstra_astar.m
test_drawing.m
test_duality.m
test_face_reorientation.m
test_filling_holes.m
test_flattening.m
test_free_boundary.m
test_grid_data.m
test_image_approx_refinement.m
test_image_approx_thining.m
test_laplacian_curve.m
test_levelset_mesh.m
test_lloyd.m
test_mesh.m
test_mesh_processing.m
test_mesh_simplification.m
test_mesh_smoothing.m
test_mex.m
test_parameterization.m
test_spectra.m
test_spherical_triangulation_...
test_tets.m
test_wave_equation.m
toolbox_graph.m
View all files

from Toolbox Graph by Gabriel Peyre
A toolbox to perform computations on graph.

perform_dijkstra_propagation.m

% perform_dijkstra_propagation - shortest distance on graph
%
%   This is impemented in a mex file.
%
%   [D,S] = perform_dijkstra_propagation(W,start_verts,end_verts,nb_iter_max,H);
%    D is the distance to starting points.
%    S is the state : dead=-1, open=0, far=1.
%    
%    Copyright (c) 2005 Gabriel Peyr

Highlights from Toolbox Graph

Highlights from
Toolbox Graph