Laplacian smoothing and Delaunay triangulations
- 1 November 1988
- journal article
- research article
- Published by Wiley in Communications in Applied Numerical Methods
- Vol. 4 (6) , 709-712
- https://doi.org/10.1002/cnm.1630040603
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- A storage-efficient method for construction of a Thiessen triangulationRocky Mountain Journal of Mathematics, 1984
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Automatic triangulation of arbitrary planar domains for the finite element methodInternational Journal for Numerical Methods in Engineering, 1974
- AN IRREGULAR TRIANGLE MESH GENERATORPublished by Office of Scientific and Technical Information (OSTI) ,1964