Universität zu Köln

Zellmann, Stefan, Schulze, Juergen P. and Lang, Ulrich ORCID: 0000-0001-7166-0805 (2021). Binned k-d Tree Construction for Sparse Volume Data on Multi-Core and GPU Systems. IEEE Trans. Vis. Comput. Graph., 27 (3). S. 1904 - 1916. LOS ALAMITOS: IEEE COMPUTER SOC. ISSN 1941-0506

Full text not available from this repository.

Abstract

While k-d trees are known to be effective for spatial indexing of sparse 3-d volume data, full reconstruction, e.g. due to changes to the alpha transfer function during rendering, is usually a costly operation with this hierarchical data structure. In a recent publication we showed how to port a clever state of the art k-d tree construction algorithm to a multi-core CPU architecture and by means of thorough optimization we were able to obtain interactive reconstruction rates for moderately sized to large data sets. The construction scheme is based on maintaining partial summed-volume tables that fit in the L1 cache of the multi-core CPU and that allow for fast occupancy queries. In this work we propose a GPU implementation of the parallel k-d tree construction algorithm and compare it with the original multi-core CPU implementation. We conduct a thorough comparative study that outlines performance and scalability of our implementation.

Item Type:	Journal Article
Creators:	Creators Email ORCID ORCID Put Code Zellmann, Stefan UNSPECIFIED UNSPECIFIED UNSPECIFIED Schulze, Juergen P. UNSPECIFIED UNSPECIFIED UNSPECIFIED Lang, Ulrich UNSPECIFIED orcid.org/0000-0001-7166-0805 UNSPECIFIED
URN:	urn:nbn:de:hbz:38-577793
DOI:	10.1109/TVCG.2019.2938957
Journal or Publication Title:	IEEE Trans. Vis. Comput. Graph.
Volume:	27
Number:	3
Page Range:	S. 1904 - 1916
Date:	2021
Publisher:	IEEE COMPUTER SOC
Place of Publication:	LOS ALAMITOS
ISSN:	1941-0506
Language:	English
Faculty:	Unspecified
Divisions:	Unspecified
Subjects:	no entry
Uncontrolled Keywords:	Keywords Language Computer Science, Software Engineering Multiple languages
URI:	http://kups.ub.uni-koeln.de/id/eprint/57779