KREYLOS, O. AND HAMANN, B. 2001. On simulated annealing and the construction of linear spline approximations for scattered data, IEEE Transactions on Visualisation and Computer Graphics, 7, 1, 17-31.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Using Quadratic Simplicial Elements for Hierarchical.. - Wiley, Childs.. (2002) Self-citation (Hamann) (Correct)
No context found.
Kreylos, O. and Hamann, B. (1999), On simulated annealing and the construction of linear spline approximations for scattered data, in: Grller, E., Lffelmann, H. and Ribarsky, W., eds., Data Visualization '99 (Proc. EUROGRAPHICS-IEEE TCCG Symposium on Visualization), Springer-Verlag, Vienna, Austria, pp. 189--198.
On Simulated Annealing and the Construction of Linear Spline.. - Kreylos, Hamann (2001) (3 citations) Self-citation (Kreylos Hamann) (Correct)
No context found.
Kreylos, O. and Hamann, B. On simulated annealing and the construction of linear spline approximations for scattered data, in: Groller, E., Lo#elmann, H. and Ribarsky, W., eds., Proc. "EUROGRAPHICS-IEEE TCCG Symposium on Visualization", Data Visualization '99 (1999), Springer Verlag, Vienna, Austria, pp. 189--198
Simplification of Large, Closed Triangulated - Surfaces Using Atomic Self-citation (Kreylos Hamann) (Correct)
....using the min # approach, one has to determine, for a given number n, an approximation that consists of n vertices and minimizes the approximation error. Many of the common algorithms use min # optimization, and several references are given in [2] 6] Of special interest is Kreylos and Hamann [4], since they use a method closely related to the one presented here. Using a min # approximation approach, one tries to find an approximation with the minimal number of vertices that satisfies a tolerance condition [1] This approach is relevant for scientific applications. For example, given the ....
....function value than a smaller number of large angles. This leads to near planar platelets of triangles, where we can delete vertices. This target function is also easy to compute and can be recomputed locally after local changes. To change a configuration, we use the method of Kreylos and Hamann [4], adapted to our problem. We use three different operations: edge rotation, vertex removal, and vertex movement. The edge rotation only changes the triangulation of two neighboring triangles. To move a vertex we randomly choose a new position inside a small sphere around the original one. To check ....
O. Kreylos, B. Hamann. On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data. Proceedings of the Joint EUROGRAPHICS-IEEE TVCG Symposium on Visualization, Vienna, Austria, May 1999, pp. 189-198.
Automated Meshing of Sparse 3D Point Clouds - Oli Cooper Neill (2003) (Correct)
No context found.
KREYLOS, O. AND HAMANN, B. 2001. On simulated annealing and the construction of linear spline approximations for scattered data, IEEE Transactions on Visualisation and Computer Graphics, 7, 1, 17-31.
Automatic Augmentation and Meshing of Sparse 3D Scene Structure - Oli Cooper Neill (Correct)
No context found.
O. Kreylos and B. Hamann. On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data. IEEE Transactions on Visualization and Computer Graphics, 7(1):17--31, 2001.
SVG Rendering of Real Images Using Data Dependent - Battiato, Gallo, Messina (2004) (Correct)
No context found.
O. Kreylos, B. Hamman. On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data. IEEE Transactions on Visualization and Computer Graphics, vol. 7 (1) (2001) pages 17-31
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC