View source: R/surface-graph.R
| get_surface_distance | R Documentation |
Builds a graph from a triangular mesh and computes shortest-path (Dijkstra) distances between vertices.
get_surface_distance(vertices, faces, source_vertices = NULL)
vertices |
Numeric matrix (n x 3) of vertex coordinates. |
faces |
Integer matrix (m x 3) of face indices (1-indexed). |
source_vertices |
Optional integer vector of source vertex indices.
If |
Numeric distance matrix. If source_vertices is provided, returns
a length(source_vertices) x n matrix; otherwise an n x n matrix.
Markello RD et al. (2022) Nature Methods 19:1472-1480. doi:10.1038/s41592-022-01625-w
vertices <- matrix(
c(0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1),
nrow = 4, byrow = TRUE
)
faces <- matrix(c(1L, 2L, 3L, 2L, 3L, 4L), nrow = 2, byrow = TRUE)
get_surface_distance(vertices, faces)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.