Algorithm 626: TRICP: a contour plot program triangular meshes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 626: TRICP: a contour plot program triangular meshes

Full text

Pdf (186 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 10 , Issue 4 (December 1984) table of contents

Pages: 473 - 475

Year of Publication: 1984

ISSN:0098-3500

Author

Albrecht Preusser

Konrad-Zuse-Zentrum fu¨r Informationstechnik Berlin

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 89, Citation Count: 4

Additional Information:

appendices and supplements references cited by index terms review

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/2701.2772 What is a DOI?

APPENDICES and SUPPLEMENTS

TRICP (626.gz) (16 KB)

computing contours of a function defined by a set of irregularly distributed data points in the plane.
Gams: Q

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	AKIMA, H. A method of bivariate interpolation and smooth surface fitting for values given at irregularly distributed points. OT Rep. 75-70, U.S. Government Printing Office, Washington D C., Aug. 1975.
	2	Hiroshi Akima, Algorithm 526: Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points [E1], ACM Transactions on Mathematical Software (TOMS), v.4 n.2, p.160-164, June 1978 [doi>10.1145/355780.355787]
	3	MEISSNER, L.P. Zero--Local root finder. FORTRAN program, VIM (Control Data User Organization) Catalog Identification, C2BKYZERO, Oct. 1965.
	4	PREUSSER, A. Bivariate Interpolation uber Dreieckselementen durch Polynome 5. Ordnung mit C1-Kontinultat. Ze~tschr. {. Vermessungswesen 109, 6 (June 1984), 292-301.
	5	Albrecht Preusser, Computing contours by successive solution of quintic polynomial equations, ACM Transactions on Mathematical Software (TOMS), v.10 n.4, p.463-472, Dec. 1984 [doi>10.1145/2701.2770]
	6	SCHWARZ, H.R. Methode der finiten Elemente. B.G. Teubner, Stuttgart, 1980, p. 289. ALGORITHM

CITED BY 4

	A. Preusser, Algorithm 671: FARB-E-2D: fill area with bicubics on rectangles—a contour plot program, ACM Transactions on Mathematical Software (TOMS), v.15 n.1, p.79-89, March 1989
	Albrecht Preusser, Computing contours by successive solution of quintic polynomial equations, ACM Transactions on Mathematical Software (TOMS), v.10 n.4, p.463-472, Dec. 1984
	Robert R. Dickinson , Richard H. Bartels, The definition, editing, and contouring of surfaces for the analysis of field problems, ACM SIGCHI Bulletin, v.17 n.SI, p.109-114, May 1987
	Robert R. Dickinson , Richard H. Bartels , Allan H. Vermeulen, The Interactive Editing and Contouring of Empirical Fields, IEEE Computer Graphics and Applications, v.9 n.3, p.34-43, May 1989

INDEX TERMS

Classification:
G. Mathematics of Computing

I. Computing Methodologies
I.3 COMPUTER GRAPHICS
I.3.5 Computational Geometry and Object Modeling
Subjects: Curve, surface, solid, and object representations

General Terms:
Algorithms

REVIEW

"Hausi Albert Muller : Reviewer"

These two papers describe a method, and the corresponding FORTRAN program, for generating contours of a piecewise quintic function defined over a triangulated region. The algorithm uses Akima's method [1] to generate the surface from scattered d more...

Adobe Acrobat

QuickTime

Windows Media Player

Real Player