Best Quadratic Spline Approximation for Hierarchical Visualization
View/
Date
2002Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
We present a method for hierarchical data approximation using quadratic simplicial elements for domain decomposition and field approximation. Higher-order simplicial elements can approximate data better than linear elements. Thus, fewer quadratic elements are required to achieve similar approximation quality. We use quadratic basis functions and compute best quadratic simplicial spline approximations that are C0-continuous everywhere. We adaptively refine a simplicial approximation by identifying and bisecting simplicial elements with largest errors. It is possible to store multiple approximation levels of increasing quality. We have tested the suitability and efficiency of our hierarchical data approximation scheme by applying it to several data sets.
BibTeX
@inproceedings {10.2312:VisSym:VisSym02:133-140,
booktitle = {Eurographics / IEEE VGTC Symposium on Visualization},
editor = {D. Ebert and P. Brunet and I. Navazo},
title = {{Best Quadratic Spline Approximation for Hierarchical Visualization}},
author = {Wiley, D. F. and Childs, H. R. and Hamann, B. and Joy, K. I. and Max, N. L.},
year = {2002},
publisher = {The Eurographics Association},
ISSN = {1727-5296},
ISBN = {1-58113-536-X},
DOI = {10.2312/VisSym/VisSym02/133-140}
}
booktitle = {Eurographics / IEEE VGTC Symposium on Visualization},
editor = {D. Ebert and P. Brunet and I. Navazo},
title = {{Best Quadratic Spline Approximation for Hierarchical Visualization}},
author = {Wiley, D. F. and Childs, H. R. and Hamann, B. and Joy, K. I. and Max, N. L.},
year = {2002},
publisher = {The Eurographics Association},
ISSN = {1727-5296},
ISBN = {1-58113-536-X},
DOI = {10.2312/VisSym/VisSym02/133-140}
}