pyFM.mesh.geometryΒΆ
Functions
|
Build the sparse symmetric edge-weighted graph used for Dijkstra-based geodesic distance computation. |
|
Compute per-face areas of a triangular mesh. |
|
Compute face normals of a triangular mesh. |
|
Compute per-vertex areas of a triangular mesh. |
|
Compute geodesic distances from one or several source vertices to all vertices, using Dijkstra's algorithm on a precomputed edge-weighted graph. |
|
Compute the divergence of a vector field on a mesh. |
|
Compute all edges in the mesh. |
|
Sample points using farthest point sampling. |
|
Sample points using farthest point sampling, initialized randomly. |
|
Sample points using farthest point sampling on a mesh, restricted to a set of samples. |
|
Sample points using farthest point sampling from a complete distance matrix. |
|
Compute the geodesic distance matrix using Dijkstra's algorithm. |
|
Compute the geodesic distance matrix using the Fast Marching algorithm. |
|
Compute the linear orientation operator associated to a gradient field grad(f). |
|
Compute the gradient of one or multiple functions on a mesh. |
|
Return the gradient operator as a (3 * m, n) matrix G. |
|
Compute geodesic distances between vertices of index inds and all other vertices using the Heat Method. |
|
Compute geodesic distances between all pairs of vertices using the Heat Method. |
|
Compute the geodesic distance matrix using the Heat Method, with robust computation. |
|
Return the indices of neighbor faces for each vertex. |
|
Compute per-vertex normals of a triangular mesh, with a chosen weighting scheme. |
|
Compute per-vertex normals of a triangular mesh, weighted by the area of adjacent faces. |
|
Compute per-vertex normals of a triangular mesh, with uniform weights across adjacent faces. |