Info : T is actually a triangulation -list of triangles-, in which each index corresponding to the row index of a vertex in another list -a vertices list-, it is a widely used technique used to store and write triangular meshes in mesh processing. Here below the example is a tetrahedron -4 facets-.
Solve the Sudoku Row
Project Euler: Problem 2, Sum of even Fibonacci
Symmetry of vector
Replace secondary diagonal elements of a square array
Find the nearest prime
Query edges list
Find triangles from edge
Query every vertices neighbor indices
Find edges from a vertex
Remove duplicated vertices
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office