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

筛选
英文 中文
Efficient subdivision of finite-element datasets into consistent tetrahedra 将有限元数据集有效地细分为一致的四面体
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663885
G. Albertelli, R. Crawfis
{"title":"Efficient subdivision of finite-element datasets into consistent tetrahedra","authors":"G. Albertelli, R. Crawfis","doi":"10.1109/VISUAL.1997.663885","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663885","url":null,"abstract":"The paper discusses the problem of subdividing unstructured mesh topologies containing hexahedra, prisms, pyramids and tetrahedra into a consistent set of only tetrahedra, while preserving the overall mesh topology. Efficient algorithms for volume rendering, iso-contouring and particle advection exist for mesh topologies comprised solely of tetrahedra. General finite-element simulations however, consist mainly of hexahedra, and possibly prisms, pyramids and tetrahedra. Arbitrary subdivision of these mesh topologies into tetrahedra can lead to discontinuous behaviour across element faces. This will show up as visible artifacts in the iso-contouring and volume rendering algorithms, and lead to impossible face adjacency graphs for many algorithms. The authors present various properties of tetrahedral subdivisions, and an algorithm SOP determining a consistent subdivision containing a minimal set of tetrahedra.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"8 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":"121864715","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}
引用次数: 26
Application-controlled demand paging for out-of-core visualization 用于核外可视化的应用程序控制的需求分页
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663888
M. Cox, D. Ellsworth
{"title":"Application-controlled demand paging for out-of-core visualization","authors":"M. Cox, D. Ellsworth","doi":"10.1109/VISUAL.1997.663888","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663888","url":null,"abstract":"In the area of scientific visualization, input data sets are often very large. In visualization of computational fluid dynamics (CFD) in particular, input data sets today can surpass 100 Gbytes, and are expected to scale with the ability of supercomputers to generate them. Some visualization tools already partition large data sets into segments, and load appropriate segments as they are needed. However, this does not remove the problem for two reasons: 1) there are data sets for which even the individual segments are too large for the largest graphics workstations, 2) many practitioners do not have access to workstations with the memory capacity required to load even a segment, especially since the state-of-the-art visualization tools tend to be developed by researchers with much more powerful machines. When the size of the data that must be accessed is larger than the size of memory, some form of virtual memory is simply required. This may be by segmentation, paging, or by paged segments. The authors demonstrate that complete reliance on operating system virtual memory for out-of-core visualization leads to egregious performance. They then describe a paged segment system that they have implemented, and explore the principles of memory management that can be employed by the application for out-of-core visualization. They show that application control over some of these can significantly improve performance. They show that sparse traversal can be exploited by loading only those data actually required.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"14 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":"115089845","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}
引用次数: 408
The VSBUFFER: visibility ordering of unstructured volume primitives by polygon drawing 通过多边形绘制的非结构化体基元的可见性排序
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663853
R. Westermann, T. Ertl
{"title":"The VSBUFFER: visibility ordering of unstructured volume primitives by polygon drawing","authors":"R. Westermann, T. Ertl","doi":"10.1109/VISUAL.1997.663853","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663853","url":null,"abstract":"Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years research did also concentrate on arbitrary structured or even unstructured topologies. In particular, direct volume rendering of these data types is numerically complex and mostly requires sorting the whole database. We present a new approach to direct rendering of convex, voluminous polyhedra on arbitrary grid topologies, which efficiently use hardware assisted polygon drawing to support the sorting procedure. The key idea of this technique lies in a two pass rendering approach. First, the volume primitives are drawn in polygon mode to obtain their cross sections in the VSBUFFER orthogonal to the viewing plane. Second, this buffer is traversed in front to back order and the volume integration is performed. Thus, the complexity of the sorting procedure is reduced. Furthermore, any connectivity information can be completely neglected, which allows for the rendering of arbitrary scattered, convex polyhedra.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"23 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":"115477612","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}
引用次数: 30
ROAMing terrain: Real-time Optimally Adapting Meshes 漫游地形:实时优化适应网格
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663860
M. Duchaineau, M. Wolinsky, David E. Sigeti, Mark C. Miller, C. Aldrich, M. Mineev-Weinstein
{"title":"ROAMing terrain: Real-time Optimally Adapting Meshes","authors":"M. Duchaineau, M. Wolinsky, David E. Sigeti, Mark C. Miller, C. Aldrich, M. Mineev-Weinstein","doi":"10.1109/VISUAL.1997.663860","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663860","url":null,"abstract":"Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor simulation. On current graphics hardware, the problem is to maintain dynamic, view-dependent triangle meshes and texture maps that produce good images at the required frame rate. We present an algorithm for constructing triangle meshes that optimizes flexible view-dependent error metrics, produces guaranteed error bounds, achieves specified triangle counts directly and uses frame-to-frame coherence to operate at high frame rates for thousands of triangles per frame. Our method, dubbed Real-time Optimally Adapting Meshes (ROAM), uses two priority queues to drive split and merge operations that maintain continuous triangulations built from pre-processed bintree triangles. We introduce two additional performance optimizations: incremental triangle stripping and priority-computation deferral lists. ROAM's execution time is proportional to the number of triangle changes per frame, which is typically a few percent of the output mesh size; hence ROAM's performance is insensitive to the resolution and extent of the input terrain. Dynamic terrain and simple vertex morphing are supported.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"18 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":"125325119","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}
引用次数: 860
Visualizing the behaviour of higher dimensional dynamical systems 可视化高维动力系统的行为
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663867
R. Wegenkittl, H. Loffelmann, E. Groller
{"title":"Visualizing the behaviour of higher dimensional dynamical systems","authors":"R. Wegenkittl, H. Loffelmann, E. Groller","doi":"10.1109/VISUAL.1997.663867","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663867","url":null,"abstract":"In recent years scientific visualization has been driven by the need to visualize high-dimensional data sets within high-dimensional spaces. However most visualization methods are designed to show only some statistical features of the data set. The paper deals with the visualization of trajectories of high-dimensional dynamical systems which form a L/sub n//sup n/ data set of a smooth n-dimensional flow. Three methods that are based on the idea of parallel coordinates are presented and discussed. Visualizations done with these new methods are shown and an interactive visualization tool for the exploration of high-dimensional dynamical systems is proposed.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"10 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":"127918508","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}
引用次数: 96
Auralization of streamline vorticity in computational fluid dynamics data 计算流体动力学数据中流线涡度的可视化
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663856
C. Volpe, E. Glinert
{"title":"Auralization of streamline vorticity in computational fluid dynamics data","authors":"C. Volpe, E. Glinert","doi":"10.1109/VISUAL.1997.663856","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663856","url":null,"abstract":"Presents a new method for auralization of the vorticity of a streamline in a vector field. This technique involves using a composite tone formed by superimposing sine waves of various amplitudes whose frequency and amplitude vary in such a way as to give the perception that the resulting sound increases or decreases endlessly in pitch without ever extending beyond the listener's range of audible frequencies. Continuous clockwise or counterclockwise rotations of a streamline resulting from vorticity can then be displayed aurally as an apparently continuous increase or decrease in pitch.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"6 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":"122048806","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}
引用次数: 2
Dynamic color mapping of bivariate qualitative data 二元定性数据的动态颜色映射
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663874
P. Rheingans
{"title":"Dynamic color mapping of bivariate qualitative data","authors":"P. Rheingans","doi":"10.1109/VISUAL.1997.663874","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663874","url":null,"abstract":"Color is widely and reliably used to display the value of a single scalar variable. It is more rarely, and far less reliably, used to display multivariate data. Dynamic control over the parameters of the color mapping results in a more effective environment for the exploration of multivariate spatial distributions. The paper describes an empirical study comparing the effectiveness of static versus dynamic representations for the exploration of qualitative aspects of bivariate distributions. In this experiment, subjects made judgments about the correspondence of the shape, location, and magnitude of two patterns under conditions with varying amounts of random noise. Subjects made significantly more correct judgements (p<0.001) about feature shape and relative positions using the dynamic representation, on average forty-five percent more. The differences between static and dynamic representations were greater in the presence of noise.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"87 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":"133382995","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}
引用次数: 17
Instructional software for visualizing optical phenomena 可视化光学现象的教学软件
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663918
D. Banks, J. Foley, Kiril Vidimce, M. Kiu
{"title":"Instructional software for visualizing optical phenomena","authors":"D. Banks, J. Foley, Kiril Vidimce, M. Kiu","doi":"10.1109/VISUAL.1997.663918","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663918","url":null,"abstract":"We describe a multidisciplinary effort for creating interactive 3D graphical modules for visualizing optical phenomena. These modules are designed for use in an upper-level undergraduate course. The modules are developed in Open Inventor, which allows them to run under both Unix and Windows. The work is significant in that it applies contemporary interactive 3D visualization techniques to instructional courseware, which represents a considerable advance compared to the current state of the practice.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"1 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":"131128750","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}
引用次数: 4
Visualization of plant growth 植物生长可视化
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.5555/266989.267125
J. J. Loomis, Xiuwen Liu, Zhaohua Ding, K. Fujimura, M. Evans, Hideo Ishikawa
{"title":"Visualization of plant growth","authors":"J. J. Loomis, Xiuwen Liu, Zhaohua Ding, K. Fujimura, M. Evans, Hideo Ishikawa","doi":"10.5555/266989.267125","DOIUrl":"https://doi.org/10.5555/266989.267125","url":null,"abstract":"The measurement, analysis and visualization of plant growth is of primary interest to plant biologists. We are developing software tools to support such investigations. There are two parts in this investigation, namely growth visualization of (i) a plant root and (ii) a plant stem. For both domains, the input data is a stream of images taken by cameras. The tools being developed make it possible to measure various time-varying quantities, such as differential growth. For both domains, the plant is modeled by using flexible templates to represent non-rigid motions.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"1 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":"123542905","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}
引用次数: 6
Image synthesis from a sparse set of views 从一组稀疏视图合成图像
Proceedings. Visualization '97 (Cat. No. 97CB36155) Pub Date : 1997-10-01 DOI: 10.1109/VISUAL.1997.663892
Qian Chen, G. Medioni
{"title":"Image synthesis from a sparse set of views","authors":"Qian Chen, G. Medioni","doi":"10.1109/VISUAL.1997.663892","DOIUrl":"https://doi.org/10.1109/VISUAL.1997.663892","url":null,"abstract":"The authors present an image synthesis methodology and a system built around it. Given a sparse set of photographs taken from unknown viewpoints, the system generates images from new, different viewpoints with correct perspective, and handles occlusion. It achieves this without requiring any knowledge about the 3D structure of the scene nor the intrinsic camera parameters. The photo-realistic rendering process is polygon based and can be potentially implemented as real time texture mapping. The system is robust to noise by taking advantage of duplicate information from multiple views. They present results on several example scenes.","PeriodicalId":225083,"journal":{"name":"Proceedings. Visualization '97 (Cat. No. 97CB36155)","volume":"32 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":"117005956","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书