THE PULL-PUSH ALGORITHM REVISITED - Improvements, Computation of Point Densities, and GPU Implementation
Martin Kraus
2009
Abstract
The pull-push algorithm is a well-known and very efficient pyramid algorithm for the interpolation of scattered data with many applications in computer graphics. However, the original algorithm is not very well suited for an implementation on GPUs (graphics processing units). In this work, several improvements of the algorithm are presented to overcome this limitation, and important details of the algorithm are clarified, in particular the importance of the correct normalization of the employed filters. Moreover, we present an extension for a very efficient estimate of the local density of sample points.
DownloadPaper Citation
in Harvard Style
Kraus M. (2009). THE PULL-PUSH ALGORITHM REVISITED - Improvements, Computation of Point Densities, and GPU Implementation . In Proceedings of the Fourth International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2009) ISBN 978-989-8111-67-8, pages 179-184. DOI: 10.5220/0001772601790184
in Bibtex Style
@conference{grapp09,
author={Martin Kraus},
title={THE PULL-PUSH ALGORITHM REVISITED - Improvements, Computation of Point Densities, and GPU Implementation},
booktitle={Proceedings of the Fourth International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2009)},
year={2009},
pages={179-184},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001772601790184},
isbn={978-989-8111-67-8},
}
in EndNote Style
TY - CONF
JO - Proceedings of the Fourth International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2009)
TI - THE PULL-PUSH ALGORITHM REVISITED - Improvements, Computation of Point Densities, and GPU Implementation
SN - 978-989-8111-67-8
AU - Kraus M.
PY - 2009
SP - 179
EP - 184
DO - 10.5220/0001772601790184