[1] L. Chen and J. Xu, “Optimal Delaunay Triangulations,” Journal of Computational Mathematics, Vol. 22, No. 2, 2004, pp. 299-308.
[2] L. Chen, “Mesh Smoothing Schemes Based on Optimal Delaunay Triangulations,” Proceedings of 13th International Meshing Roundtable, Williamsburg 19-22 September 2004, pp. 109-120.
[3] P. Alliez, D. Cohen-Steiner, M. Yvinec and M. Desbrun, “Variational Tetrahedral Meshing,” ACM Transactions on Graphics, Vol. 24, No. 3, 2005, pp. 617-625.
http://dx.doi.org/10.1145/1073204.1073238
[4] X. S. Li, “An Efficient Approach to a Class of Non-Smooth Optimization Problems,” Science in China Series A, Vol. 24, No. 4, 1994, pp. 371-377.
[5] S. L. Sun and J. F. Liu, “An Efficient Optimization Procedure for Tetrahedral Meshes by Chaos Search Algorithm,” Journal of Computer Science and Technology, Vol. 18, No. 6, 2003, pp. 796-803.
http://dx.doi.org/10.1007/BF02945469
[6] J. F. Liu, S. L. Sun and D. C.Wang, “Optimal Tetrahedralization for Small Polyhedron: A New Local Transformation Strategy for 3-d Mesh Generation and Mesh Improvement,” CMES: Computer Modeling in Engineering & Sciences, Vol. 14, No. 1, 2006, pp. 31-43.