Algorithm 751: TRIPACK: A Constrained Two-Dimensional Delaunay Triangulation Package

ACM Transactions on Mathematical Software

Volumn 22, Issue 1, 1996, Pages 1-8

  Renka, R J ^a  

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Algorithms; Constrained Delaunay triangulation; D.3.2 Programming Languages : Language Classifications Fortran; G.1.1 Numerical Analysis : Interpolation; G.1.2 Numerical Analysis : Approximation; G.4 Mathematics of Computing : Mathematical Software

Indexed keywords

COMPUTER SOFTWARE; FORTRAN (PROGRAMMING LANGUAGE); INTERPOLATION; MATHEMATICAL TECHNIQUES; NUMERICAL ANALYSIS;

APPROXIMATION; CONSTRAINED DELAUNAY TRIANGULATION; TRIPACK;

ALGORITHMS;

EID: 0030092479     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/225545.225546     Document Type: Article

References (5)

1. CLINE, A. K. AND RENKA, R. J. 1984. A storage-efficient method for construction of a Thiessen triangulation. Rocky Mount. J. Math. 14, 1 (Winter), 119-139.
2. CLINE, A. K. AND RENKA, R. J. 1990. A constrained two-dimensional triangulation and the solution of closest node problems in the presence of barriers. SIAM J. Numer. Anal. 27 (Oct.), 1305-1321.
3. DELAUNAY, B. 1934. Sur la sph re vide. Bull. Acad. Sci. USSR(VII), Classe Sci. Mat. Nat. 793-800.
4. 1 surface interpolation. In Mathematical Software III, J. R. Rice, Ed. Academic Press, New York, 161-194.
5. PREPARATA, F. P. AND SHAMOS, M. I. 1985. Computational Geometry. An Introduction. Springer-Verlag, New York.