Multi-segment and multi-stage projected tetrahedra

Projected tetrahedra is a popular volume rendering technique to find the interior features of tetrahedral datasets. It is a view-dependent technique and needs to sort the tetrahedra before rendering. Sorting is time-consuming and affects the efficiency of the visualization heavily. To solve this problem, our approach partitions datasets into multiple segments in space and divides the visualizing procedure into multiple stages in time. Multiple segments help sorting in parallel without write access violations while multiple stages can satisfy different requirements and increase users’ cognition. Cloud computing can help this process because datasets are large and sorting is complex. The experiment results show that our visualization approach for tetrahedral datasets is an exact and efficient approach, which accords with cognitive laws.

[1]  Nelson L. Max,et al.  Sorting and hardware assisted rendering for volume visualization , 1994, VVS '94.

[2]  Nelson L. Max,et al.  Optical Models for Direct Volume Rendering , 1995, IEEE Trans. Vis. Comput. Graph..

[3]  Valerio Pascucci,et al.  Progressive Volume Rendering of Large Unstructured Grids , 2006, IEEE Transactions on Visualization and Computer Graphics.

[4]  Sally A. McKee,et al.  Characterizing and subsetting big data workloads , 2014, 2014 IEEE International Symposium on Workload Characterization (IISWC).

[5]  Jin Li,et al.  Securely Outsourcing Attribute-Based Encryption with Checkability , 2014, IEEE Transactions on Parallel and Distributed Systems.

[6]  Jayadev Misra,et al.  A Constructive Proof of Vizing's Theorem , 1992, Inf. Process. Lett..

[7]  Jin Li,et al.  New Privacy-Preserving Location Sharing System for Mobile Online Social Networks , 2013, 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing.

[8]  Peter L. Williams Visibility-ordering meshed polyhedra , 1992, TOGS.

[9]  Kenneth Moreland,et al.  Tetrahedral projection using vertex shaders , 2002, Symposium on Volume Visualization and Graphics, 2002. Proceedings. IEEE / ACM SIGGRAPH.

[10]  Nelson L. Max,et al.  Image-space visibility ordering for cell projection volume rendering of unstructured data , 2004, IEEE Transactions on Visualization and Computer Graphics.

[11]  Joseph S. B. Mitchell,et al.  Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids , 1998, Comput. Graph. Forum.

[12]  Peter Shirley,et al.  A polygonal approximation to direct scalar volume rendering , 1990, SIGGRAPH 1990.

[13]  Ilsun You,et al.  New order preserving encryption model for outsourced databases in cloud environments , 2016, J. Netw. Comput. Appl..

[14]  Joseph S. B. Mitchell,et al.  An exact interactive time visibility ordering algorithm for polyhedral cell complexes , 1998, IEEE Symposium on Volume Visualization (Cat. No.989EX300).

[15]  Philippas Tsigas,et al.  GPU-Quicksort: A practical Quicksort algorithm for graphics processors , 2010, JEAL.

[16]  Cláudio T. Silva,et al.  Hardware-assisted visibility sorting for unstructured volume rendering , 2005, IEEE Transactions on Visualization and Computer Graphics.

[17]  Ricardo Marroquim,et al.  Volume and Isosurface Rendering with GPU‐Accelerated Cell Projection * , 2008, Comput. Graph. Forum.

[18]  Ricardo Marroquim,et al.  Hardware‐Assisted Projected Tetrahedra , 2010, Comput. Graph. Forum.