In Finite Element theory, and other methods in scientific computing for PDEs, one uses meshes which fulfill several regularity criteria, many of them being equivalent.
It is of interest to have notions of shape-regularity in arbitrary dimensions. While some authors use this as if there were full analogies of the two-dimensional theory to higher dimensions, it seems no one has ever before established this rigorously. Do you know a reference on this?
The correct answer was already given by Jed Brown in a comment, but a brief explanation might help. Shape regularity enters into finite element methods when stitching together local interpolation errors to get a global interpolation error (which is an upper bound for the approximation error and hence, by Céa's lemma, for the discretization error). Basically, you get local interpolation errors by estimating the interpolation error on a reference element (using the Bramble-Hilbert lemma) and then transforming it to each local element. This transformation gives you
on the right hand side of the estimate. In order to obtain a global error estimate with only this power of (the maximal occuring) $h$ on the right hand side, you thus need a uniform bound for this condition number.
For simplicial meshes, you can show (independently of the dimension!) that this condition number can be estimated by the ratio of the diameters of the inscribed and the circumscribed (or minimal containing) ball. (In two dimensions, this ratio can in turn be estimated by $2/\sin(\vartheta)$, where $\vartheta$ is the smallest angle of the triangle.) If this ratio is uniformly bounded for all elements, the mesh is called shape regular. Hence in this case the usual definition is already dimension independent. You can find a detailed treatment in Chapter 1.5 of Ern and Guermond, Theory and Practice of Finite Elements.
(For rectangular meshes, you would probably use bounds of the condition number in terms of ratios of maximal and minimal edge lengths, which also makes sense for arbitrary dimensions, although I don't have any reference for that.)
Note that this is a separate issue from mesh quality, which also takes into account the conditioning of the linear system arising from the discretization, and ignores the magnitude of the constants in the mentioned estimates.
If you are using an isoparametric formulation, the determinant of the Jacobian of your mapping has to be greater than zero in order to have a bijective mapping from the reference to the real elements. This generalizes to arbitrary dimensions, and this is the regularity criterion (if its not fulfilled its game over).
The other regularity criterion serve multiple purposes. You can have elements in which the determinant of the Jacobian is close to, but not, zero, which might lead to large errors. You might want to have a regular distribution of elements to achieve an even distribution of your error in "single-scale" problems, ...
Two possibilities are: using the diameter of the lagest n-sphere that fits inside your n-th dimensional element and trying to make this value regular across your mesh, and, restricting the minimum/maximum angles between your element faces, which are (n-1)-dimensional manifolds. Both criterion generalize to arbitrary dimensions.
There is a discussion about this in Bathe's Finite Element Procedures. I don´t remember exactly if this was also covered in Frey's and George's Mesh Generation or in Lisekin's Mesh Generation Methods.
