Yi-Jen Chiang, Claudio T. Silva, and William J. Schroeder. Interactive out-of-core isosurface extraction. IEEE Visualization '98, pages 167--174, October 1998. ISBN 0-8186-9176-X.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a small fraction of the data set, streaming algorithms that do not avoid reading all of the data can be slower than a demand paging algorithm. The second type of out of core visualization algorithms is indexing algorithms. Many indexing algorithms have been described for isosurface computation [3, 4, 8, 9, 10]. These algorithms precompute an index that identifies the portion of the data that is necessary to compute the requested visualization. For isosurface computation, the index identifies which cells contain portions of the isosurface. One disadvantage of many index algorithms is that their index is ....

Yi-Jen Chiang, Claudio T. Silva, and William J. Schroeder. Interactive out-of-core isosurface extraction. IEEE Visualization '98, pages 167--174, October 1998. ISBN 0-8186-9176-X.

....the number of rendering servers and k is the replication factor. We have shown that k = 4 works quite well. However, data visualization applications may require an out of core method to store and traverse their databases. Previous studies have focused on out of core techniques for a single machine [5, 8]. We believe that k way replication principles can apply to out of core database management for multiple computers. For instance, it may be beneficial to store multiple copies of each data element on different disks in order to provide flexibility regarding which computers load and process data. ....

Yi-Jen Chiang, Claudio T. Silva, and William J. Schroeder. Interactive out-of-core isosurface extraction. IEEE Visualization '98, pages 167--174, 1998.

....isosurface. The isosurface construction begins at a seed and is traced through neighboring cells using adjacency and intersection information. An algorithm to improve I O performance and allow efficient isosurface extraction on data sets larger than physical memory was described by Chiang et al. [2, 3]. An interval tree is built on disk using a two level hierarchy. Cells are first grouped into meta cells and a meta interval defined. These meta intervals are then composed into an interval tree, which is divided into disk block sized groups to allow efficient transfer from disk. Weigle and Banks ....

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, Proceedings of Visualization 1998, pages 167--174. IEEE Computer Society, ACM Press, New York, NY, October 1998.

....isosurface. The isosurface construction begins at a seed and is traced through neighboring cells using adjacency and intersection information. An algorithm to improve I O performance and allow efficient isosurface extraction on data sets larger than physical memory was described by Chiang et al. [2, 3]. An interval tree is built on disk using a two level hierarchy. Cells are first grouped into meta cells and a meta interval defined. These meta intervals are then composed into an interval tree, which is divided into disk block sized groups to allow efficient transfer from disk. Shen [15] ....

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, Proceedings of Visualization 1998, pages 167--174. IEEE Computer Society, ACM Press, New York, NY, October 1998.

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