Usage: [mfRefinedMesh, mnTriangulation] = LoopSubdivisionLimited( mfMeshPoints, mnTriangulation, fMinResolution, vbBoundaryEdges)
This function sub-divides surface meshes, using the Loop subdivision algorithm . This algorithm is based on B-spline curve continuity, leading to good shape-maintaining smoothing of a surface. The algorithm attempts to leave the boundary of the surface essentially undistorted.
'mfMeshPoints' is an Nx3 matrix, each row of which ['x' 'y' 'z'] defines a point in three-dimensional space. 'mnTriangulation' is a Mx3 matrix, each row of which ['m' 'n' 'p'] defines a triangle existing on the surface, where 'm', 'n' and 'p' are indices into 'mfMeshPoints'.
'fMinResolution' defines the desired minimum length of an edge in the final subdivision. Edges shorter than 'fMinResolution' will not be divided further.
The optional argument 'vbBoundaryEdges' identifies which edges should be treated as boundary edges (and so should their locations should be attempted to be maintained by the algorithm). This argument will be calculated by the algortihm, if it is not supplied.
'mfRefinedMesh' will be a Px3 matrix, each row of which specifies a vertex in the subdivided mesh. 'mnTringulation' will be a Rx3 matrix, each row of which specifies a surface triangle in the subdivided mesh.
Algorithm from .
*ROOM FOR IMPROVEMENT*
If you work out how to maintain the vertex and edge adjacency matrices through a full subdivision run, then great! That would speed up subsequent runs a great deal, since a lot of the time is spent computing the edge adjacency matrix...
 Loop, C 1987. "Smooth subdivision surfaces based on triangles." M.S. Mathematics thesis, University of Utah. http://research.microsoft.com/en-us/um/people/cloop/thesis.pdf