Coefficient–based spline data reduction by hierarchical spaces

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a data reduction scheme for efficient surface storage, by introducing a coefficient–based least squares spline operator that does not require any pointwise evaluation to approximate (in a lower dimension spline space) a given bivariate B–spline function. In order to define an accurate approximation of the target spline with a significant reduction of the space dimension, this operator is subsequently combined with the hierarchical spline framework to design an adaptive method that exploits the capabilities of truncated hierarchical B–splines (THB–splines). The resulting THB–spline simplification approach is validated by several numerical tests. The target B–spline surfaces include approximations of functions whose analytical expression is available, reconstructions of geographic data and parametric surfaces.

Cite

CITATION STYLE

APA

Bracco, C., Giannelli, C., & Sestini, A. (2017). Coefficient–based spline data reduction by hierarchical spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10521 LNCS, pp. 23–41). Springer Verlag. https://doi.org/10.1007/978-3-319-67885-6_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free