Laplacian smoothing and Delaunay triangulations

Communications in Applied Numerical Methods

Volumn 4, Issue 6, 1988, Pages 709-712

  Field, David A ^a  

^a GM Research Lab   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS;

DELAUNAY TRIANGULATIONS; LAPLACIAN SMOOTHING;

MATHEMATICAL TECHNIQUES;

EID: 0024105978     PISSN: 07488025     EISSN: None     Source Type: Journal    
DOI: 10.1002/cnm.1630040603     Document Type: Article

References (11)

1. 1 W. R. Buell and B. A. Bush, ‘ Mesh generation — a survey ’, American Society of Mechanical Engineers Publication No. 72–WA/DE–2, 1972.
2. 2 A. M. Winslow, ‘ An irregular triangle mesh generator ’, Report No. UCRL‐7880, National Technical Information Service. Springfield, VA, 1964.
3. 3 A. Boyer. ‘ Computing Dirichlet tesselations ’, Computer J., 24, 162–166 (1981).
4. 4 J. C. Cavendish. ‘ Automatic triangulation of arbitrary planar domains for the finite element method ’, Int. j. numer. methods eng., 8, 679–696 (1974).
5. 5 D. T. Lee and B. J. Schachter. ‘ Two algorithms for constructing a Delaunay triangulation ’, Int. J. Computer Inf. Sci., 9, 219–242 (1980).
6. 6 D. F. Watson. ‘ Computing the n ‐dimensional Delaunay tesselation with applications to Voronoi polytopes ’, Computer J., 24, 167–172 (1981).
7. 7 L. J. Guibas and J. Stolfi. ‘ Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams ’, ACM Trans. Graphics, 2, 74–123 (1985).
8. 8 D. A. Field, ‘ A flexible Delaunay triangulation algorithm ’, General Motors Research Publication GMR‐5675, 1987.
9. 9 IMSL Library Reference Manual, Houston, TX.
10. 10 A. K. Cline and R. L. Renka. ‘ A storage‐efficient method for construction of a Thiessen triangulation ’, Rock Mount. J. Math., 14, 119–139 (1984).
11. 11 C. L. Lawson. ‘ Software for C 1 surface interpolation ’, In Software III, ( J. R. Rice, Ed.), Academic Press, New York, 1977. pp. 161–193.