Well-Centered Triangulation

An irregular triangle mesh generator

Winslow, A. M · 1964

Earlier work this paper cites.

Locally equiangular triangulations

Sibson, R · 1978

Earlier work this paper cites.

The circumradius-inradius inequality for a simplex

Klamkin, M. S., and Tsintsifas, G. A · 1979

Earlier work this paper cites.

Manifolds, Tensor Analysis, and Applications

Abraham, R., Marsden, J. E., and Ratiu, T · 1988

Earlier work this paper cites.

Laplacian smoothing and Delaunay triangulations

Field, D. A · 1988

Earlier work this paper cites.

An O ⁡ ( n 2 ​ log ⁡ n ) {O}(n^{2}\log n) time algorithm for the minmax angle triangulation

Edelsbrunner, H., Tan, T., and Waupotitsch, R · 1992

Earlier work this paper cites.

Coping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes

Melissaratos, E. A., and Souvaine, D. L · 1992

Earlier work this paper cites.

Direct discretization of planar div-curl problems

Nicolaides, R. A · 1992

Earlier work this paper cites.

Linear-size nonobtuse triangulation of polygons

Bern, M., Mitchell, S., and Ruppert, J · 1994

Earlier work this paper cites.

Provably good mesh generation

Bern, M. W., Eppstein, D., and Gilbert, J · 1994

Earlier work this paper cites.

Optimality of the Delaunay triangulation in ℝ d \mathbb{R}^{d}

Rajan, V · 1994

Earlier work this paper cites.

Mesh generation and optimal triangulation

Bern, M. W., and Eppstein, D · 1995

Earlier work this paper cites.

A Delaunay refinement algorithm for quality 2-dimensional mesh generation

Ruppert, J · 1995

Earlier work this paper cites.

Incremental topological flipping works for regular triangulations

Edelsbrunner, H., and Shah, N. R · 1996

Earlier work this paper cites.

Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator

Shewchuk, J. R · 1996

Earlier work this paper cites.

Centroidal Voronoi tessellations: applications and algorithms

Du, Q., Faber, V., and Gunzburger, M · 1999

Cited alongside, same era.

Geometry and Topology for Mesh Generation

Edelsbrunner, H · 2001

Cited alongside, same era.

Building spacetime meshes over arbitrary spatial domains

Erickson, J., Guoy, D., Sullivan, J., and Üngör, A · 2002

Cited alongside, same era.

Acute triangulations of polygons

Maehara, H · 2002

Cited alongside, same era.

Pitching tents in space-time: Mesh generation for discontinuous Galerkin method

Üngör, A., and Sheffer, A · 2002

Cited alongside, same era.

The mesquite mesh quality improvement toolkit

Brewer, M., Diachin, L., Knupp, P., Leurent, T., and Melander, D · 2003

Cited alongside, same era.

Convergence of the Lloyd algorithm for computing centroidal Voronoi tessellations

Du, Q., Emelianenko, M., and Ju, L · 2006

Later among the works it cites.

Smooth Delaunay–Voronoi dual meshes for co-volume integration schemes

Sazonov, I., Hassan, O., Morgan, K., and Weatherill, N. P · 2006

Later among the works it cites.

Yee’s scheme for the integration of Maxwell’s equation on unstructured meshes

Sazonov, I., Hassan, O., Morgan, K., and Weatherill, N. P · 2006

Later among the works it cites.

A stitching method for the generation of unstructured meshes for use with co-volume solution techniques

Sazonov, I., Wang, D., Hassan, O., Morgan, K., and Weatherill, N. P · 2006

Later among the works it cites.

Computing acute and non-obtuse triangulations

Erten, H., and Üngör, A · 2007

Later among the works it cites.

Mesh shape-quality optimization using the inverse mean-ratio metric