Laplacian smoothing and Delaunay triangulations

In contrast to most triangulation algorithms which implicitly assume that triangulation point locations are fixed, ‘Laplacian’ smoothing focuses on moving point locations to improve triangulation. Laplacian smoothing is attractive for its simplicity but it does require an existing triangulation. In this paper the effect of Laplacian smoothing on Delaunay triangulations is explored. It will become clear that constraining Laplacian smoothing to maintain a Delaunay triangulation measurably improves Laplacian smoothing.