Problem statement
An tetrahedron is a regular polyhedron with 4 vertices and 4 triangular faces. It is also one of the five well known platonic solids.
A triangulated mesh -or a triangulation- is simply a N x 3 matrix of positive integers where each row contains the vertex indices of a triangle, and where N is the number of triangles.
Your task here is to mesh this tetrahedron. To do so, you will list the triangles/rows in a matrix of triangles, T. You will also be careful to always keep the triangles / faces coherently / consistently oriented (all clockwise or all counterclockwise : triangles [1, 2, 3] and [3, 2, 1] are distinct).
On the other hand [1, 2, 3], [2, 3, 1] and [3, 1, 2] are one same unique triangle.
The row order of the triangles in the list doesn't matter.
Edit / update
Triangles orientation not taken into account anymore, because of too many possible cases to check in the tests (!)
Example
The first triangle (X > 0 and Y > 0) here can be [1, 2, 4] if counterclockwise oriented (normals outward).
Forbidden functions / expressions
  • regexp
  • assignin
  • str2num
  • echo
See also

Solution Stats

39 Solutions

35 Solvers

Last Solution submitted on Dec 21, 2025

Last 200 Solutions

Problem Comments

Solution Comments

Show comments
Loading...