此工具箱包含处理图形和三角测量的有用函数。
This toolbox contains useful functions to deal with graph and triangulation.
具有n个顶点的图形的基本表示是邻接矩阵A，如果顶点 i 连接到顶点 j，则A(i,j)=1。
The basic representation of a graph of n vertices is the adjacency matrix A where A(i,j)=1 if vertex i is linked to vertex j.
图形通常在R^d中具备一种几何实现形式，即(d,n)矩阵，其中vertex(:,i)是第 i 个顶点的位置。
A graph often comes with a geometric realization in R^d which an (d,n) matrix where vertex(:,i) is the position of the ith vertex.
对于m面和n个顶点的三角测量通过以下方式表示：
A triangulation of m faces and n vertex is represented through:
*一组面，由一个(3,m)矩阵表示，其中face(:,i)是第 i 个面的顶点索引。
- a set of faces which is a (3,m) matrix where face(:,i) are the vertices indexes of the ith face.
*一组顶点，由一个(d,n)矩阵表示。
- a set of vertex which is a (d,n) matrix.
该工具箱包含更容易处理三角测量数据结构的功能，允许检索顶点和面1环，并在相邻面之间切换。
The toolbox contains function to deal more easily with a triangulation data structure, and allows to retrieve vertex and face 1-ring and switch from adjacency to faces.
工具箱的图部分包含创建合成图和计算最短路径的函数（dijkstra和isomap算法）。
The graph part of the toolbox contains function to creates synthetic graph and compute shortest path (dijkstra and isomap algorithm).
工具箱包含许多处理三角测量光谱理论的函数。
This toolbox contains a lot of function to deal with spectral theory of triangulation.
可以从文件加载三角测量数据，然后显示生成的网格。
You can load triangulations from files and then display the resulting mesh.
允许计算各种拉普拉斯算子，并使用谱分解、谐波映射、自由边界谐波映射和等值线图计算参数。
It allows to compute various laplacian operator, and the to compute parameterization using spectral decomposition, harmonic mapping, free boundary harmonic mapping, and isomap.
源码下载地址：
http://page2.dfpan.com/fs/3lcjb22182914694ea2/
更多精彩文章请关注微信号：