|Parallel iso-surface extraction and simplification
|WSCG 2014: communication papers proceedings: 22nd International Conference in Central Europeon Computer Graphics, Visualization and Computer Visionin co-operation with EUROGRAPHICS Association, p. 361-368.
|Václav Skala - UNION Agency
|Keywords in different language:
|Abstract in different language:
|When extracting iso-surfaces from large volume data sets, long processing times are required and a high number of polygons is generated. We propose a massively parallel iso-surface extraction and simplification algorithm. The extraction is based on the marching cubes algorithm. In order to process large volume data sets, we perform the extraction with an interleaved simplification step using parallel edge collapses and the quadric error metrics. Interleaving extraction and simplification is based on locally postponing collapse operations close to the processing front. In contrast to previous methods, we do not need an explicit simplification error fall-off close to the front. Thus we can produce meshes with the same quality as if we would simplify the complete mesh after extraction. By implementing both extraction and simplification on the GPU, we can reconstruct high quality iso-surfaces from large data sets within a few seconds.
|@ Václav Skala - UNION Agency
|Appears in Collections:
|WSCG 2014: Communication Papers Proceedings
Please use this identifier to cite or link to this item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.