CHIANG, Y.-J., SILVA, C. T., AND SCHROEDER, W. J. 1998. Interactive out-of-core isosurface extraction. In Proc. IEEE Visualization, 167--174.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in a variety of applications, which include computational uid dynamics, thermodynamics, structural mechanics, etc. Recently, research has been focused on visualization techniques that work directly on these kinds of meshes, thus making it possible to avoid re sampling the eld onto a regular grid [2, 15, 25]. Re sampling is often not feasible because of the large variation of cell size and of the nonconvex shape of the domain. Re sampling is sometimes not even desirable since the user may want to zoom on small portions of the mesh, and analyze details and the shape of the tetrahedral elements ....

Y. Chiang, C. T. Silva. Interactive out-of-core isosurface extraction. In Proceedings IEEE Visualization '98, pages 167-174, Research Triangle Park, 1998. IEEE Press.

....method for FEM data by dynamically distributing working blocks to a number of connected workstations. Shen et al. 31] implement a parallel algorithm by partitioning load in the span space. Parker et al. 27] present a parallel isosurface rendering algorithm using ray tracing. Chiang and Silva [6, 8] give an implementation of out of core isocontouring using the I O optimal external interval tree on a single processor. Bajaj et al. 2] use range partition to reduce the size of data that are loaded for given isocontour queries and balance the load within a range partition. More recently Zhang ....

CHIANG, Y.-J., SILVA, C. T., AND SCHROEDER, W. J. Interactive out-of-core isosurface extraction. In Proceedings of the 9th Annual IEEE Conference on Visualization (VIS-98) (Oct. 18--23 1998), ACM Press, pp. 167--174.

....cells. Chiang et al. Chiang and Silva 97] applied this idea but changed the branching factor to make the size of each node in the interval tree no bigger than a disk block to significantly reduce the number of disk I Os and the memory required for query processing. Later Chiang et al. Chiang et al. 98] extended their work to perform out of core iso surface extraction as well by partitioning the original grids into meta cells and used a KD tree decomposition to make sure each meta cell fit into the memory. 7.2 Layered Structures for Surface Extraction Out of Core Iso Unlike the work by ....

....their work to perform out of core iso surface extraction as well by partitioning the original grids into meta cells and used a KD tree decomposition to make sure each meta cell fit into the memory. 7. 2 Layered Structures for Surface Extraction Out of Core Iso Unlike the work by Chiang et al. Chiang et al. 98] which decomposes a data set spatially according to its coordinates information, we argue that a decomposition of a data set based on its scalar values should be be more efficient, as iso surface extraction is to extract surfaces for a particular iso value. The value based decomposition ....

Y. Chiang, C.T. Silva, and W.J. Schroeder. Interactive Out-of- Core Isosurface Extraction. In IEEE Visualization '98, pages 167 174, October 1998.

....in amortized update bounds. In Section 4, we then show how to remove the amortization from the structure. Our external interval tree has been used to develop I O ecient structures for dynamic point location [1, 9] It has also been used in several visualization application by Chiang and Silva [17, 19, 18]. Our weight balanced B tree has also found several other applications. In internal memory it can, for example, be used to convert amortized bounds to worst case bounds (Fixing B to a constant in our result yields an internal memory interval tree with worst case update bounds. It can also be used ....

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive out-of-core isosurface extraction. In Proc. IEEE Visualization, pages 167-174, 1998.

....out of core techniques have been developed for other geometric applications. In the graphics domain, these applications include large building walk throughs, radiosity, and ray tracing [9, 23, 18] In the visualization domain, several researchers have addressed out of core isosurface extraction [6, 5, 22, 2]; others have looked at visualization of terrain and computational fluid dynamics, including streamlines on meshes [8, 7, 24] Although our input is geometric, the problem of updating connectivity pointers in a topological data structure actually has a closer analogy in building object oriented ....

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive out-of-core isosurface extraction. In Proceedings IEEE Visualization '98, pages 167--74, October 1998.

....the work described above focuses on the common problem of extracting a complete isocontour from a given scalar field defined over a mesh. It is worth mentioning recent work on specialized modifications of this problem, including adaptive 7 isocontour extraction [34, 44] out of core computation [3, 4], view dependent isosurfacing [16] and extraction of time varying isosurfaces [30] Each of these problems introduces new (and possibly conflicting) factors when considering which algorithm will work best. We will discuss these and other issues throughout the paper. 2.5 Summary of Prior Work A ....

CHIANG, Y.-J., SILVA, C. T., AND SCHROEDER, W. J. Interactive out-of-core isosurface extraction. In Proceedings of IEEE Visualization '98 (Oct. 1998), pp. 167--174.

.... a parallel algorithm by partitioning load in the span space [31] Parker et al. present a parallel isosurface rendering algorithm using ray tracing [26] Chiang and Silva give an implementation of out of core isocontouring using the I O optimal external interval tree on a single processor [7, 8]. Bajaj et al. use range Common of the shelf partition to reduce the size of data that are loaded for given isocontour queries and balance the load within a range partition [3] In this paper, we propose and implement a parallel and out of core isocontouring algorithm using parallel processors ....

....whole range of data according to the workload histogram. The partitioning of the whole range avoids the problem of data duplication among different range partitions. After data is partitioned, an I Ooptimal interval tree [1] is built as index structure for the data on each disk in a way similar to [8]. The external memory interval tree has optimal O(log N K) I O operations for stabbing queries, where K is the number of active cells. Cell is the minimum unit of the volume dataset. Function values are defined on the vertices of the cells and usually tri linearly interpolated inside cell. ....

[Article contains additional citation context not shown here]

CHIANG, Y.-J., SILVA, C. T., AND SCHROEDER, W. J. Interactive out-of-core isosurface extraction. In Proceedings of the 9th Annual IEEE Conference on Visualization (VIS-98) (New York, Oct. 18--23 1998), ACM Press, pp. 167--174.

.... implement a parallel algorithm by partitioning load in the span space [28] Parker et al. present a parallel isosurface rendering algorithm using ray tracing [24] Chiang and Silva give an implementation of out ofcore isocontouring using the I O optimal external interval tree on a single processor [8, 9]. Bajaj et al. use range partition to reduce the size of data that are loaded for given isocontour queries and balance the load within a range partition [3] In this paper, we propose and implement a parallel and out of core isocontouring algorithm using parallel processors and parallel I O, which ....

....range of data according to the workload histogram. The partitioning of the whole range avoids the problem of data duplication among different range partitions. After data is partitioned, an I O optimal interval tree [1] is built as index structure for the data on each disk in a way similar to [9]. The external memory interval tree has optimal UV WGX Y C Z I O operations for stabbing queries, where K is the number of active cells. Cell is the minimum unit of the volume dataset. Function values are defined on the vertices of the cells and usually tri linearly interpolated inside ....

[Article contains additional citation context not shown here]

CHIANG, Y.-J., SILVA, C. T., AND SCHROEDER, W. J. Interactive out-of-core isosurface extraction. In Proceedings of the 9th Annual IEEE Conference on Visualization (VIS-98) (Oct. 18--23 1998), ACM Press, pp. 167--174.

....can be stored about each multislab in O(1) blocks. Similar ideas have been utilized in several other external data structures [14, 25, 3, 28] Variants of the external interval tree structure, as well as applications of it in isosurface extraction, have been considered by Chiang and Silva [29, 60, 62, 61] (see also [7] Planar point location. The planar point location problem is defined as follows: Given a planar subdivision with N vertices (i.e. a decomposition of the plane into polygonal regions induced by a straight line planar graph) construct a data structure so that the face containing a ....

....Parallel I O Programming Environment) project at Duke [17, 148] We briefly discuss these projects and the experiments performed within them below. Outside these projects, a few other authors have reported on stand alone implementations of geometric algorithms [57, 58] external interval trees [60 62], buffer trees [96] and string B trees [79] LEDA SM. LEDA SM is an extension of the LEDA library [115] of efficient algorithms and data structures. It consists of a kernel that gives an abstract view of external memory as a collection of disks, each consisting of a collection of blocks. The ....

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive out-of-core isosurface extraction. In Proc. IEEE Visualization, pages 167--174, 1998.

No context found.

CHIANG, Y.-J., SILVA, C. T., AND SCHROEDER, W. J. 1998. Interactive out-of-core isosurface extraction. In Proc. IEEE Visualization, 167--174.

No context found.

Yi-Jen Chiang, Claudio T. Silva, and William J. Schroeder. Interactive out-of-core isosurface extraction. In David Ebert, Hans Hagen, and Holly Rushmeier, editors, IEEE Visualization '98, pages 167-- 174, 1998.

No context found.

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive out-of-core isosurface extraction. In Proc. IEEE Visualization, pages 167--174, 1998.

No context found.

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive Out-Of-Core Isosurface Extraction. IEEE Visualization 98, 167--174, Oct. 1998.

....In Sec. 2.1, we present the computational model of [3] In Sec. 2. 2, we review three techniques in batched computations that are fundamental for out of core scientific visualization and graphics: external merge sort [3] out of core pointer de referencing [14,17,18] and the meta cell technique [20]. In Sec. 2.3, we review some important data structures for on line computations, namely the B tree [9, 26] and B tree like data structures, and show a general method of converting a main memory, binary tree structure into a B tree like data structure. In particular, we review the BBIO tree [19, ....

....[20] In Sec. 2.3, we review some important data structures for on line computations, namely the B tree [9, 26] and B tree like data structures, and show a general method of converting a main memory, binary tree structure into a B tree like data structure. In particular, we review the BBIO tree [19, 20], which is an external memory version of the main memory interval tree [33] and is essential for isosurface extraction, as a non trivial example. 2.1 Computational Model In contrast to random access main memory, disks have extremely long access times. In order to amortize this access time over a ....

[Article contains additional citation context not shown here]

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive Out-Of-Core Isosurface Extraction. IEEE Visualization 98, 167--174, Oct. 1998.

....Silva AT T Bin Wei AT T Abstract In this paper, we present a unified infrastructure for parallel out ofcore isosurface extraction and volume rendering of large unstructured grids on distributed memory parallel machines. We parallelize the out of core isosurface extraction algorithm of [9] and the out of core ZSweep technique [17] for direct volume rendering, using the meta cell technique as a unified underlying building block. Our one time preprocessing first partitions the dataset into metacells that are stored in disk. From the meta cells, we build a BBIO tree in disk, which ....

....volume rendering for large unstructured grids, using out of core techniques that are parallelized for distributed memory parallel machines with a local disk and a limited size main memory available for each node. We parallelize the out of core isosurface extraction algorithm of Chiang et al. [9] and the out of core ZSweep technique of Farias and Silva [17] for direct volume rendering, using the meta cell technique first developed in [9] as a unified underlying building block. In the preprocessing phase, we partition the original dataset into clusters of cells, called meta cells, which ....

[Article contains additional citation context not shown here]

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive out-of-core isosurface extraction. In Proc. IEEE Visualization, pages 167--174, 1998.

No context found.

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive Out-Of-Core Isosurface Extraction. In IEEE Visualization, Research Triangle Park, North Carolina, USA, October 1998. IEEE Computer Society Press.

No context found.

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive Out-Of-Core Isosurface Extraction. In IEEE Visualization, Research Triangle Park, North Carolina, USA, October 1998. IEEE Computer Society Press.

No context found.

Y.-J. Chiang, C.T. Silva and W.J. Schroeder, Interactive Out-Of-Core Isosurface Extraction, IEEE Visualization 98, 167-174, Nov. 1998.

No context found.

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder, "Interactive out-of-core isosurface extraction," in IEEE Visualization '98, pp. 167--174, 530, IEEE, Computer Society Press, Oct. 1998.

No context found.

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder. Interactive Out-Of-Core Isosurface Extraction. In IEEE Visualization, Research Triangle Park, North Carolina, USA, October 1998. IEEE Computer Society Press.

No context found.

Y.-J. Chiang, C. T. Silva, and W. J. Schroeder, "Interactive out-of-core isosurface extraction," in IEEE Visualization '98, pp. 167--174, 530, IEEE, Computer Society Press, Oct. 1998.

No context found.

CHIANG Y. - J , S ILVA C. T., SCHROEDER W. J .: Interactive out-of-core isosurface extraction. In IEEE Visualization '98 (VIS '98) (Washington - Brussels - Tokyo, Oct. 1998), IEEE, pp. 167--174. 2

No context found.

CHIANG, Y.-J., SILVA, C. T., AND SCHROEDER, W. J. Interactive out-of-core isosurface extraction (color plate p. 530). In Proceedings of the 9th Annual IEEE Conference on Visualization (VIS-98) (New York, Oct. 18--23 1998), ACM Press, pp. 167--174.

No context found.

CHIANG, Y.-J., SILVA, C. T., AND SCHROEDER, W. J. Interactive out-of-core isosurface extraction. In Proceedings of the 9th Annual IEEE Conference on Visualization (VIS-98) (Oct. 18--23 1998), ACM Press, pp. 167--174.

No context found.

CHIANG, Y., SILVA, C. T., AND SCHROEDER, W. J. Interactive out-of-core isosurface extraction. In Proceedings of Visualization 1998 (Oct. 1998), pp. 167-- 174.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC