Packing large segmented volumes for visual analysis
Sergey Belyaev · 2023
Volumetric data subject to visual analysis can occupy hundreds of gigabytes, which excludes the possibility of their visualization with an acceptable frame rate on conventional computers. If the data is segmented, its volume can be significantly reduced by tringulating the surfaces of the segments. This solution works well for opaque segments. This paper proposes an algorithm for packing segmented volumes, which allows the user to dynamically control the transparency of the segments, which facilitates the visual analysis of volumetric data. The algorithm assumes that the direction of observation is fixed. Therefore, if you want to analyze the volume from several angles, packing must be performed for each angle independently.