Abstract
Thinning algorithms are greedy point removal schemes for scattered data, where the points are recursively removed according to some specific removal criterion. This yields a hierarchy of the input data,which is used for building a multi resolution approximation of a model object,a mathematical function. In general, thinning algorithms are therefore useful tools for model simplification and data reduction.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Iske, A. (2004). Thinning Algorithms. In: Multiresolution Methods in Scattered Data Modelling. Lecture Notes in Computational Science and Engineering, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18754-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-18754-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20479-4
Online ISBN: 978-3-642-18754-4
eBook Packages: Springer Book Archive