Abstract
AbstractWe present a novel smart visibility system for visualizing crowded volumetric data containing many object instances. The presented approach allows users to form groups of objects through membership predicates and to individually control the visibility of the instances in each group. Unlike previous smart visibility approaches, our approach controls the visibility on a per-instance basis and decides which instances are displayed or hidden based on the membership predicates and the current view. Thus, cluttered and dense volumes that are notoriously difficult to explore effectively are automatically sparsified so that the essential information is extracted and presented to the user. The proposed system is generic and can be easily integrated into existing volume rendering applications and applied to many different domains. We demonstrate the use of the volume conductor for visualizing fiber-reinforced polymers and intracellular organelle structures.
Funder
King Abdullah University of Science and Technology
Österreichische Forschungsförderungsgesellschaft
Publisher
Springer Science and Business Media LLC
Subject
Computer Graphics and Computer-Aided Design,Computer Vision and Pattern Recognition,Software
Reference30 articles.
1. Ament, M., Zirr, T., Dachsbacher, C.: Extinction-optimized volume illumination. IEEE Trans. Visual Comput. Graph. 23(7), 1767–1781 (2017)
2. Bohak, C.: Intracellular Compartments in Urothelial Cells of Mouse Bladder. In: KAUST Cell Visualization Summit. King Abdullah University of Science and Technology (KAUST), Thuwal, Kingdom of Saudi Arabia (2019)
3. Bruckner, S., Grimm, S., Kanitsar, A., Groller, E.: Illustrative context-preserving exploration of volume data. IEEE Trans. Visual Comput. Graph. 12(6), 1559–1569 (2006)
4. Chan, M.Y., Qu, H., Chung, K.K., Mak, W.H., Wu, Y.: Relation-aware volume exploration pipeline. IEEE Trans. Visual Comput. Graph. 14(6), 1683–1690 (2008)
5. Correa, C.D., Ma, K.L.: Visibility histograms and visibility-driven transfer functions. IEEE Trans. Visual Comput. Graph. 17(2), 192–204 (2011)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献