Abstract
A variety of triangulation algorithms to link points of irregular data sets have been developed over the last decade. Presented here is a simple scheme which utilizes an implicity geometry common to all sets of planar points.
Zusammenfassung
Eine Anzahl von Dreiecksalgorithmen, die Punkte unregelmäßiger Datengruppen verbinden, sind während der letzten zehn Jahre entwickelt worden. Die vorliegende Arbeit beschreibt ein einfaches Schema, das eine implizite Geometrie verwendet, die allen Gruppen von Flächendatapunkten gemeinsam ist.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. E. Barnhill,Representation and approximation of surfaces. In Mathematical Software III, pp. 69–120, Ed. by J. R. Rice, Academic Press, New York 1977.
C. L. Lawson,Software for C' surface interpolation. IbidIn, pp. 161–194, Academic Press, New York 1977.
E. R. Magnus,Selection of triangle sets for the analysis of randomly spaced data. Honours Thesis in Mathematics, School of Mathematical and Physical Sciences, Murdoch University. See also Report No. 1, Tropical Cyclone Study Group, Murdoch University 1981.
J. M. Nelson,A triangulation algorithm for arbitrary planar domains. Applied Math. Modelling2, 151–159 (1978).
N. L. K. Pitteway,Computer graphics research in an academic environment. Datafair 73 Conference Proceedings,2 471–478 (1973).
W. D. Scott, C. C. Joyce, and E. R. Magnus,Optimization of a triangle net. Applied Math. Modelling,6, 397–398 (1982).
W. L. Thacker,An improved triangulation algorithm. Applied Math. Modelling,3, 471–472 (1979).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Magnus, E.R., Joyce, C.C. & Scott, W.D. A spiral procedure for selecting a triangular grid from random data. Z. angew. Math. Phys. 34, 231–235 (1983). https://doi.org/10.1007/BF00944594
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00944594