Abstract
We describe a method to create optimal linear spline approximations to arbitrary functions of one or two variables, given as scattered data without known connectivity. We start with an initial approximation consisting of a fixed number of vertices and improve this approximation by choosing different vertices, governed by a simulated annealing algorithm. In the case of one variable, the approximation is defined by line segments; in the case of two variables, the vertices are connected to define a Delaunay triangulation of the selected subset of sites in the plane. In a second version of this algorithm, specifically designed for the bivariate case, we choose vertex sets and also change the triangulation to achieve both optimal vertex placement and optimal triangulation. We then create a hierarchy of linear spline approximations, each one being a superset of all lower-resolution ones.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonneau, G.-P., Hahmann, S. and Nielson, G. M., BLaC-wavelets: A multiresolution analysis with non-nested spaces, in Yagel, R. and Nielson, G. M., eds., Visualization ‘86 (1996), IEEE Computer Society Press, Los Alamitos, CA, pp. 43–48
Eck, M., DeRose, A.D., Duchamp, T., Hoppe, H., Lounsbery, M. and Stuetzle, W., Multiresolution analysis of arbitrary meshes, in Cook, R., ed., Proc. SIG-GRAPH 1995, ACM Press, New York, NY, pp. 173–182
Gieng, T. S., Hamann, B., Joy, K.I., Schussman, G. L. and Trotts, I. J., Constructing hierarchies for triangle meshes, in IEEE Transactions on Visualization and Computer Graphics 4 (2) (1998), pp. 145–161
Hamann, B., A data reduction scheme for triangulated surfaces, in Computer Aided Geometric Design 11 (2) (1994), pp. 197–214
Hamann, B., Jordan, B. J. and Wiley, D. A., On a construction of a hierarchy of best linear spline approximations using repeated bisection, in IEEE Transactions on Visualization and Computer Graphics 4(4) (1998)
de Berg, M., van Kreveld, M., Overmars, M. and Schwarzkopf, O., Computational Geometry (1990), Springer-Verlag, New York, NY
Edelsbrunner, H., Algorithms in Combinatorial Geometry (1987), Springer-Verlag, New York, NY
Preparata, F. P., Shamos, M. I., Computational Geometry, third printing (1990), Springer-Verlag, New York, NY
Schumaker, L. L. Computing Optimal Triangulations Using Simulated Annealing, in Computer Aided Geometric Design 10 (1993), pp. 329–345
Nielson, G. M., Scattered data modeling, in IEEE Computer Graphics and Applications 13 (1) (1993), pp. 60–70
Press, W. H., Teukolsky, S. A., Vetterling, W. T., and Flannery, B. P. Numerical Recipes in C, 2nd ed. (1992), Cambridge University Press, Cambridge, MA
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E., in Journal of Chemical Physics 21 (1953), pp. 1087–1092
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag/Wien
About this paper
Cite this paper
Kreylos, O., Hamann, B. (1999). On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data. In: Gröller, E., Löffelmann, H., Ribarsky, W. (eds) Data Visualization ’99. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6803-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6803-5_18
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83344-5
Online ISBN: 978-3-7091-6803-5
eBook Packages: Springer Book Archive