Geometry and Topology for Mesh Generation. Herbert Edelsbrunner. Cambridge Univ. Press, England, 2001.
Mesh generation. M. Bern and P. Plassmann. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier Science, 1999. [ PostScript ]
Mesh Generation: Application to Finite Elements. Pascal Jean Frey and Paul-Louis George. Hermes Science Publishing, 2000. ISBN 1-903398-00-2. [ Amazon ]
Computational Geometry: Algorithms and Applications. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Springer, 1997.
Delaunay Refinement Mesh Generation. Jonathan Shewchuk. Ph.D. thesis, Technical Report CMU-CS-97-137, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, 18 May 1997.
Non-Simplicial Unstructured Mesh Generation. Steven J. Owen. Ph.D. dissertation, Department of Civil and Environmental Engineering, Carnegie Mellon University, April 1999.
What Is a Good Linear Element? Interpolation, Conditioning, and Quality Measures. Jonathan Shewchuk. Eleventh International Meshing Roundtable (Ithaca, New York), pages 115-126, Sandia National Laboratories, September 2002
Application Challenges to Computational Geometry: CG Impact Task Force Report. Various authors. April 1996. Chapter 7: Mesh Generation is most relevant. [ Online ]
Delaunay Refinement Algorithms for Triangular Mesh Generation. Jonathan Shewchuk. Computational Geometry: Theory and Applications 22(1-3):21-74, May 2002.
Mesh Generation for Domains with Small Angles. Jonathan Shewchuk. Proceedings of the Sixteenth Annual Symposium on Computational Geometry (Hong Kong), pages 1-10, Association for Computing Machinery, June 2000.
Off-centers: A new type of Steiner points for computing size-optimal guaranteed-quality Delaunay triangulations. Alper Üngör. Proceedings of LATIN 2004, pp. 152-161, April 5-9, Buenos Aires, Argentina.
Provably Good Mesh Generation. Marshall Bern, David Eppstein, and John Gilbert. Journal of Computer and System Sciences, Volume 48, Issue 3, Pages 384 - 409, June 1994.
Quality Mesh Generation in Higher Dimensions. Scott A. Mitchell and Stephen A. Vavasis. SIAM Journal on Computing, Volume 29, Issue 4, Pages 1334 - 1370, 2000.
Quadrilateral Meshing by Circle Packing. Marshall Bern, David Eppstein. Int. J. Comp. Geom. & Appl. 10(4):347-360, Aug. 2000 A preliminary version of this work was presented at the 6th Int. Meshing Roundtable, Park City, Utah, 1997
A Mesh Warping Algorithm Based on Weighted Laplacian Smoothing. Suzanne M. Shontz, Stephen A. Vavasis. In Proc. International Meshing Roundtable, pages 147--158, 2003. [ PDF ]
Sliver removal by lattice refinement. François Labelle. In Proc. 22nd Annual Symposium on Computational Geometry (SoCG), pages 347--356, 2006.
Optimal Triangulation and Quadric-Based Surface Simplification. Paul Heckbert and Michael Garland. Journal of Computational Geometry: Theory and Applications, 14(1-3), pp. 49-65, November 1999.
Quadric-Based Polygonal Surface Simplification. Michael Garland. Ph.D. dissertation, Computer Science Department, Carnegie Mellon University, CMU-CS-99-105, May 1999.
Quadric-based Simplification in any Dimension. M. Garland and Y. Zhou. ACM Transactions on Graphics, 24(2), April 2005. Draft preprint available as Tech Report UIUCDCS-R-2004-2450.
Non-simplicial meshes (hexahedral, hybrid meshes, curved boundaries); Topological guarantees; Applications