Proceedings. Visualization '97 (Cat. No. 97CB36155)最新文献

Case study: wildfire visualization 案例研究:野火可视化

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-11-01 DOI: 10.1109/VISUAL.1997.663919

J. Ahrens, P. McCormick, J. Bossert, J. Reisner, J. Winterkamp

引用次数: 9

I/O optimal isosurface extraction I/O优化等值面提取

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-19 DOI: 10.1109/VISUAL.1997.663895

Yi-Jen Chiang, Cláudio T. Silva

{"title":"I/O optimal isosurface extraction","authors":"Yi-Jen Chiang, Cláudio T. Silva","doi":"10.1109/VISUAL.1997.663895","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663895","url":null,"abstract":"The authors give I/O-optimal techniques for the extraction of isosurfaces from volumetric data, by a novel application of the I/O-optimal interval tree of Arge and Vitter (1996). The main idea is to preprocess the data set once and for all to build an efficient search structure in disk, and then each time one wants to extract an isosurface, they perform an output-sensitive query on the search structure to retrieve only those active cells that are intersected by the isosurface. During the query operation, only two blocks of main memory space are needed, and only those active cells are brought into the main memory, plus some negligible overhead of disk accesses. This implies that one can efficiently visualize very large data sets on workstations with just enough main memory to hold the isosurfaces themselves. The implementation is delicate but not complicated. They give the first implementation of the I/O-optimal interval tree, and also implement their methods as an I/O filter for Vtk's isosurface extraction for the case of unstructured grids. They show that, in practice, the algorithms improve the performance of isosurface extraction by speeding up the active-cell searching process so that it is no longer a bottleneck. Moreover, this search time is independent of the main memory available. The practical efficiency of the techniques reflects their theoretical optimality.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134315633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 124

Case study: visualizing customer segmentations produced by self organizing maps 案例研究:由自组织地图生成的可视化客户细分

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-19 DOI: 10.1109/VISUAL.1997.663922

H. Rushmeier, R. Lawrence, G. Almási

引用次数: 12

Dynamic smooth subdivision surfaces for data visualization 动态平滑细分表面的数据可视化

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663905

Chhandomay Mandal, Hong Qin, B. Vemuri

{"title":"Dynamic smooth subdivision surfaces for data visualization","authors":"Chhandomay Mandal, Hong Qin, B. Vemuri","doi":"10.1109/VISUAL.1997.663905","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663905","url":null,"abstract":"Recursive subdivision schemes have been extensively used in computer graphics and scientific visualization for modeling smooth surfaces of arbitrary topology. Recursive subdivision generates a visually pleasing smooth surface in the limit from an initial user-specified polygonal mesh through the repeated application of a fixed set of subdivision rules. In this paper, we present a new dynamic surface model based on the Catmull-Clark (1978) subdivision scheme, which is a very popular method to model complicated objects of arbitrary genus because of many of its nice properties. Our new dynamic surface model inherits the attractive properties of the Catmull-Clark subdivision scheme as well as that of the physics-based modeling paradigm. This new model provides a direct and intuitive means of manipulating geometric shapes, a fast, robust and hierarchical approach for recovering complex geometric shapes from range and volume data using very few degrees of freedom (control vertices). We provide an analytic formulation and introduce the physical quantities required to develop the dynamic subdivision surface model which can be interactively deformed by applying synthesized forces in real time. The governing dynamic differential equation is derived using Lagrangian mechanics and a finite element discretization. Our experiments demonstrate that this new dynamic model has a promising future in computer graphics, geometric shape design and scientific visualization.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115312885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Visualization of higher order singularities in vector fields 向量场中高阶奇点的可视化

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663858

G. Scheuermann, H. Hagen, H. Krüger, Martin Menzel, A. Rockwood

引用次数: 73

Visualization of large terrains in resource-limited computing environments 资源有限计算环境下大型地形的可视化

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663863

B. Rabinovich, C. Gotsman

{"title":"Visualization of large terrains in resource-limited computing environments","authors":"B. Rabinovich, C. Gotsman","doi":"10.1109/VISUAL.1997.663863","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663863","url":null,"abstract":"The authors describe a software system supporting interactive visualization of large terrains in a resource-limited environment, i.e. a low-end client computer accessing a large terrain database server through a low-bandwidth network. By \"large\", they mean that the size of the terrain database is orders of magnitude larger than the computer RAM. Superior performance is achieved by manipulating both geometric and texture data at a continuum of resolutions, and, at any given moment, using the best resolution dictated by the CPU and bandwidth constraints. The geometry is maintained as a Delaunay triangulation of a dynamic subset of the terrain data points, and the texture compressed by a progressive wavelet scheme. A careful blend of algorithmic techniques enables the system to achieve superior rendering performance on a low-end computer by optimizing the number of polygons and texture pixels sent to the graphics pipeline. It guarantees a frame rate depending only on the size and quality of the rendered image, independent of the viewing parameters and scene database size. An efficient paging scheme minimizes data I/O, thus enabling the use of the system in a low-bandwidth client/server data-streaming scenario, such as on the Internet.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114826309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 38

A topology modifying progressive decimation algorithm 一种拓扑修改渐进式抽取算法

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663883

W. Schroeder

引用次数: 148

Integrated volume compression and visualization 集成体积压缩和可视化

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663900

T. Chiueh, Chuan-Kai Yang, Taosong He, H. Pfister, A. Kaufman

{"title":"Integrated volume compression and visualization","authors":"T. Chiueh, Chuan-Kai Yang, Taosong He, H. Pfister, A. Kaufman","doi":"10.1109/VISUAL.1997.663900","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663900","url":null,"abstract":"Volumetric data sets require enormous storage capacity even at moderate resolution levels. The excessive storage demands not only stress the capacity of the underlying storage and communications systems, but also seriously limit the speed of volume rendering due to data movement and manipulation. A novel volumetric data visualization scheme is proposed and implemented in this work that renders 2D images directly from compressed 3D data sets. The novelty of this algorithm is that rendering is performed on the compressed representation of the volumetric data without pre-decompression. As a result, the overheads associated with both data movement and rendering processing are significantly reduced. The proposed algorithm generalizes previously proposed whole-volume frequency-domain rendering schemes by first dividing the 3D data set into subcubes, transforming each subcube to a frequency-domain representation, and applying the Fourier projection theorem to produce the projected 2D images according to given viewing angles. Compared to the whole-volume approach, the subcube-based scheme not only achieves higher compression efficiency by exploiting local coherency, but also improves the quality of resultant rendering images because it approximates the occlusion effect on a subcube by subcube basis.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114781892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 61

The multilevel finite element method for adaptive mesh optimization and visualization of volume data 基于多层次有限元的体数据自适应网格优化与可视化

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663907

R. Grosso, C. Lürig, T. Ertl

{"title":"The multilevel finite element method for adaptive mesh optimization and visualization of volume data","authors":"R. Grosso, C. Lürig, T. Ertl","doi":"10.1109/VISUAL.1997.663907","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663907","url":null,"abstract":"Multilevel representations and mesh reduction techniques have been used for accelerating the processing and the rendering of large datasets representing scalar- or vector-valued functions defined on complex 2D or 3D meshes. We present a method based on finite element approximations which combines these two approaches in a new and unique way that is conceptually simple and theoretically sound. The main idea is to consider mesh reduction as an approximation problem in appropriate finite element spaces. Starting with a very coarse triangulation of the functional domain, a hierarchy of highly non-uniform tetrahedral (or triangular in 2D) meshes is generated adaptively by local refinement. This process is driven by controlling the local error of the piecewise linear finite element approximation of the function on each mesh element. A reliable and efficient computation of the global approximation error and a multilevel preconditioned conjugate gradient solver are the key components of the implementation. In order to analyze the properties and advantages of the adaptively generated tetrahedral meshes, we implemented two volume visualization algorithms: an iso-surface extractor and a ray-caster. Both algorithms, while conceptually simple, show significant speedups over conventional methods delivering comparable rendering quality from adaptively compressed datasets.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114900260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 102

Wavelet-based multiresolutional representation of computational field simulation datasets 基于小波的计算场模拟数据集的多分辨率表示

Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663872

Zhifan Zhu, R. Machiraju, B. Fry, R. Moorhead

引用次数: 16