The Community for Technology Leaders
RSS Icon
Issue No.06 - November/December (2009 vol.15)
pp: 1367-1374
Cong Wang , Polytechnic Institute of New York University
Yi-Jen Chiang , Polytechnic Institute of New York University
We develop a new algorithm for isosurface extraction andview-dependent filtering from large time-varying fields, by using anovel Persistent Time-Octree (PTOT) indexingstructure. Previously, the Persistent Octree (POT) was proposed toperform isosurface extraction and view-dependent filtering, whichcombines the advantages of the interval tree (for optimal searches ofactive cells) and of the Branch-On-Need Octree (BONO, forview-dependent filtering), but it only works for steady-state(i.e., single time step) data. For time-varying fields, a 4D versionof POT, 4D-POT, was proposed for 4D isocontour slicing, where slicingon the time domain gives all active cells in the queried timestep and isovalue. However, such slicing is not output sensitiveand thus the searching is sub-optimal. Moreover, it was notknown how to support view-dependent filtering in addition totime-domain slicing.In this paper, we develop a novel Persistent Time-Octree (PTOT) indexing structure, which has the advantages of POT and performs 4Disocontour slicing on the time domain with an output-sensitiveand optimal searching. In addition, when we query the sameisovalue q over m consecutive time steps, there is noadditional searching overhead (except for reporting the additionalactive cells) compared to querying just the first time step. Suchsearching performance for finding active cells is asymptoticallyoptimal, with asymptotically optimal space and preprocessing time aswell. Moreover, our PTOT supports view-dependent filtering in addition to time-domain slicing. We propose a simple and effectiveout-of-core scheme, where we integrate our PTOT with implicit occluders, batched occlusion queries and batched CUDA computingtasks, so that we can greatly reduce the I/O cost as well asincrease the amount of data being concurrently computed in GPU.This results in an efficient algorithm for isosurface extraction withview-dependent filtering utilizing a state-of-the-art programmable GPUfor time-varying fields larger than main memory. Our experiments ondatasets as large as 192GB (with 4GB per time step) having no morethan 870MB of memory footprint in both preprocessing and run-timephases demonstrate the efficacy of our new technique.
Isosurface extraction, time-varying fields, persistent data structure, view-dependent filtering, out-of-core methods
Cong Wang, Yi-Jen Chiang, "Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)", IEEE Transactions on Visualization & Computer Graphics, vol.15, no. 6, pp. 1367-1374, November/December 2009, doi:10.1109/TVCG.2009.160
[1] L. Arge and J. S. Vitter, Optimal interval management in external memory. In Proc. IEEE Foundations of Comp. Sci., pages 560–569, 1996.
[2] C. Bajaj, V. Pascucci, D. Thompson, and X. Zhang, Parallel accelerated isocontouring for out-of-core visualization. In Proc. Sympos. Parallel Visualization and Graphics, pages 97–104, 1999.
[3] C. L. Bajaj, V. Pascucci, and D. R. Schikore, Fast isocontouring for improved interactivity. In 1996 Volume Visualization Symposium, pages 39– 46, Oct. 1996.
[4] U. Bordoloi and H.-W. Shen, Space efficient fast isosurface extraction for large datasets. In Proc. IEEE Visualization, 2003.
[5] Y.-J. Chiang, Out-of-core isosurface extraction of time-varying fields over irregular grids. In Proc. IEEE Visualization, pages 217–224, 2003.
[6] Y.-J. Chiang, R. Farias, C. Silva, and B. Wei, A unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of unstructured grids. In Proc. Sympos. Parallel and Large-Data Visualization and Graphics, pages 59–66, 2001.
[7] Y.-J. Chiang and C. T. Silva, I/O optimal isosurface extraction. In Proc. IEEE Visualization, pages 293–300, 1997.
[8] Y.-J. Chiang, C. T. Silva, and W. J. Schroeder, Interactive out-of-core isosurface extraction. In Proc. IEEE Visualization, pages 167–174, 1998.
[9] P. Cignoni, P. Marino, C. Montani, E. Puppo, and R. Scopigno, Speeding up isosurface extraction using interval trees. IEEE Transactions on Visualization and Computer Graphics, 3 (2): 158–170, 1997.
[10] J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan, Making data structures persistent. J. Comput Syst. Sci., 38: 86–124, 1989.
[11] J. Gao and H.-W. Shen, Hardware-assisted view-dependent isosurface extraction using spherical partition. In Proc. Symposium on Visualization, 2003.
[12] B. Gregorski, J. Senecal, M. Duchaineau, and K. Joy, Adaptive extraction of time-varying isosurfaces. IEEE Trans. Vis. Comput. Graph., 10 (6): 683–694, 2004.
[13] T. Itoh and K. Koyamada, Automatic isosurface propagation using an extrema graph and sorted boundary cell lists. IEEE Transactions on Visualization and Computer Graphics, 1 (4): 319–327, Dec. 1995.
[14] Y. Livnat and C. Hansen, View dependent isosurface extraction. In Proc. IEEE Visualization, pages 175–180, 1998.
[15] Y. Livnat, H.-W. Shen, and C. Johnson, A near optimal isosurface extraction algorithm using span space. IEEE Transactions on Visualization and Computer Graphics, 2 (1): 73–84, Mar. 1996.
[16] W. E. Lorensen and H. E. Cline, Marching cubes: A high resolution 3D surface construction algorithm. In M. C. Stone, editor, Computer Graphics (SIGGRAPH '87 Proceedings), volume 21, pages 163–169, July 1987.
[17] NVIDIA. CUDA SDK. sdk Physically-Based Simulation.html.
[18] S. Parker, P. Shirley, Y. Livnat, C. Hansen, and P.-P. Sloan, Interactive ray tracing for isosurface rendering. In Proc. IEEE Visualization, pages 233–238, 1998.
[19] S. Pesco, P. Lindstrom, V. Pascucci, and C. Silva, Implicit occluders. In Proc. IEEE Symposium on Volume Visualization and Graphics, pages 47–54, 2004.
[20] H. Shen, C. D. Hansen, Y. Livnat, and C. R. Johnson, Isosurfacing in span space with utmost efficiency (ISSUE). In IEEE Visualization '96, Oct. 1996.
[21] H.-W. Shen, Isosurface extraction in time-varying fields using a temporal hierarchical index tree. In Proc. IEEE Visualization, pages 159–166, 1998.
[22] H.-W. Shen and C. Johnson, Sweeping simplices: A fast iso-surface extraction algorithm for unstructured grids. In IEEE Visualization '95, pages 143–150, Oct. 1995.
[23] Q. Shi and J. JáJá, Isosurface extraction and spatial filtering using persistent octree (POT). IEEE Trans. Vis. Comput. Graph. (Vis'06), 12 (5): 1283–1290, 2006.
[24] C. Silva, Y.-J. Chiang, J. El-Sana, and P. Lindstrom, Out-of-core algorithms for scientific visualization and computer graphics, 2002. Tutorial Course Notes, IEEE Visualization 2002. .
[25] K. Stockinger, J. Shalf, K. Wu, and E. Bethel, Query-driven visualization of large data sets. In Proc. IEEE Visualization, pages 167–174, 2005.
[26] P. Sutton and C. Hansen, Accelerated isosurface extraction in time-varying fields. IEEE Trans. Visualization and Computer Graphics, 6 (2): 98–107, 2000.
[27] M. van Kreveld, R. van Oostrum, C. L. Bajaj, V. Pascucci, and D. R. Schikore, Contour trees and small seed sets for isosurface traversal. In Proc. ACM Symp. on Comput. Geom., pages 212–220, 1997.
[28] I. Wald, H. Friedrich, A. Knoll, and C. Hansen, Interactive isosurface ray tracing of time-varying tetrahedral volumes. IEEE Trans. Vis. Comput. Graph. (Vis'07), 13 (6): 1727–1734, 2007.
[29] K. Waters, C. Co, and K. Joy, Using difference intervals for time-varying isosurface visualization. IEEE Trans. Vis. Comput. Graph. (Vis'06), 12 (5): 1275–1282, 2006.
[30] J. Wilhelms and A. V. Gelder, Octrees for faster isosurface generation. ACM Transactions on Graphics, 11 (3): 201–227, 1992.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool