A simple and relatively efficient triangulation of the n-cube

How good are convex hull algorithms?

Proceedings of the eleventh annual symposium on Computational geometry

A Geometric Approach to Maximum-Speed n-Dimensional Continuous Linear Interpolation in Rectangular Grids

IEEE Transactions on Computers

Dihedral bounds for mesh generation in high dimensions

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Finding minimal triangulations of convex 3-polytopes is NP-hard

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Simplicial isosurfacing in arbitrary dimension and codimension

Journal of Computational Physics

The complexity of finding small triangulations of convex 3-polytopes

Journal of Algorithms - Special issue: SODA 2000

Lattice Delone simplices with super-exponential volume

European Journal of Combinatorics