Show simple item record

dc.contributor.authorReina, G.en_US
dc.contributor.authorErtl, Thomasen_US
dc.contributor.editorLouise M. Lever and Mary McDerbyen_US
dc.date.accessioned2014-01-31T19:48:58Z
dc.date.available2014-01-31T19:48:58Z
dc.date.issued2005en_US
dc.identifier.isbn3-905673-56-8en_US
dc.identifier.urihttp://dx.doi.org/10.2312/LocalChapterEvents/TPCG/TPCGUK05/051-058en_US
dc.description.abstractIn this paper we focus on the implications of implementing generic algorithms on graphics hardware. As an example, we ported the dimensionality reduction algorithm FastMap to fragment programs and thus accelerated it by orders of magnitude, allowing for interactive tweaking and evaluating of the algorithm parameters for datasets of several hundred thousand points and tens of dimensions; even the animation of structural changes in relation to parameters is possible. This allows to complement the algorithmic heuristic used by FastMap by explorative results from human interaction. Such an approach can be considered a heuristic in itself, but has the advantage of being based on visual feedback, therefore allowing for iterative improvement of the results. Thus we demonstrate how to benefit from the high execution parallelism on commodity graphics hardware as an alternative to making use of other, more costly, multiprocessing techniques. We discuss performance and bandwidth aspects as well as accuracy problems since these results are of more general interest and can be applied to general processing on graphics hardware as a whole.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleImplementing FastMap on the GPU: Considerations on General-Purpose Computation on Graphics Hardwareen_US
dc.description.seriesinformationEG UK Theory and Practice of Computer Graphicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record