发布求助
文献互助 智能选刊 最新文献

Proceedings Visualization '98 (Cat. No.98CB36276)最新文献

筛选
英文 中文
Accelerated ray-casting for curvilinear volumes 加速曲线体的光线投射
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.1109/VISUAL.1998.745310
Lichan Hong, A. Kaufman
{"title":"Accelerated ray-casting for curvilinear volumes","authors":"Lichan Hong, A. Kaufman","doi":"10.1109/VISUAL.1998.745310","DOIUrl":"https://doi.org/10.1109/VISUAL.1998.745310","url":null,"abstract":"We present an efficient and robust ray-casting algorithm for directly rendering a curvilinear volume of arbitrarily-shaped cells. We designed the algorithm to alleviate the consumption of CPU power and memory space. By incorporating the essence of the projection paradigm into the ray-casting process, we have successfully accelerated the ray traversal through the grid and data interpolations at sample points. Our algorithm also overcomes the conventional limitation requiring the cells to be convex. Application of this algorithm to several commonly-used curvilinear data sets has produced a favorable performance when compared with recently reported algorithms.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120979650","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}
引用次数: 28
Extremal feature extraction from 3-D vector and noisy scalar fields 三维矢量和噪声标量场的极值特征提取
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.1109/VISUAL.1998.745290
Chi-Keung Tang, G. Medioni
{"title":"Extremal feature extraction from 3-D vector and noisy scalar fields","authors":"Chi-Keung Tang, G. Medioni","doi":"10.1109/VISUAL.1998.745290","DOIUrl":"https://doi.org/10.1109/VISUAL.1998.745290","url":null,"abstract":"We are interested in feature extraction from volume data in terms of coherent surfaces and 3D space curves. The input can be an inaccurate scalar or vector field, sampled densely or sparsely on a regular 3D grid, in which poor resolution and the presence of spurious noisy samples make traditional iso-surface techniques inappropriate. In this paper, we present a general-purpose methodology to extract surfaces or curves from a digital 3D potential vector field {(s,v~)}, in which each voxel holds a scalar s designating the strength and a vector v~ indicating the direction. For scalar, sparse or low-resolution data, we \"vectorize\" and \"densify\" the volume by tensor voting to produce dense vector fields that are suitable as input to our algorithms, the extremal surface and curve algorithms. Both algorithms extract, with sub-voxel precision, coherent features representing local extrema in the given vector field. These coherent features are a hole-free triangulation mesh (in the surface case), and a set of connected, oriented and non-intersecting polyline segments (in the curve case). We demonstrate the general usefulness of both extremal algorithms on a variety of real data by properly extracting their inherent extremal properties, such as (a) shock waves induced by abrupt velocity or direction changes in a flow field, (b) interacting vortex cores and vorticity lines in a velocity field, (c) crest-lines and ridges implicit in a digital terrain map, and (d) grooves, anatomical lines and complex surfaces from noisy dental data.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129641121","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}
引用次数: 24
Image-based transfer function design for data exploration in volume visualization 基于图像的体可视化数据探索传递函数设计
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.1109/VISUAL.1998.745319
S. Fang, T. Biddlecome, M. Tuceryan
{"title":"Image-based transfer function design for data exploration in volume visualization","authors":"S. Fang, T. Biddlecome, M. Tuceryan","doi":"10.1109/VISUAL.1998.745319","DOIUrl":"https://doi.org/10.1109/VISUAL.1998.745319","url":null,"abstract":"Transfer function design is an integrated component in volume visualization and data exploration. The common trial-and-error approach for transfer function searching is a very difficult and time consuming process. A goal oriented and parameterized transfer function model is therefore crucial in guiding the transfer function searching process for better and more meaningful visualization results. The paper presents an image based transfer function model that integrates 3D image processing tools into the volume visualization pipeline to facilitate the search for an image based transfer function in volume data visualization and exploration. The model defines a transfer function as a sequence of 3D image processing procedures, and allows the users to adjust a set of qualitative and descriptive parameters to achieve their subjective visualization goals. 3D image enhancement and boundary detection tools, and their integration methods with volume visualization algorithms are described. The application of this approach for 3D microscopy data exploration and analysis is also discussed.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126730932","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}
引用次数: 120
Efficient co-triangulation of large data sets 大型数据集的高效共三角剖分
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.1109/VISUAL.1998.745293
H. Weimer, J. Warren, Jane Troutner, W. Wiggins, John Shrout
{"title":"Efficient co-triangulation of large data sets","authors":"H. Weimer, J. Warren, Jane Troutner, W. Wiggins, John Shrout","doi":"10.1109/VISUAL.1998.745293","DOIUrl":"https://doi.org/10.1109/VISUAL.1998.745293","url":null,"abstract":"Presents an efficient algorithm for the reconstruction of a multivariate function from multiple sets of scattered data. Given N sets of scattered data representing N distinct dependent variables that have been sampled independently over a common domain and N error tolerance values, the algorithm constructs a triangulation of the domain of the data and associates multivariate values with the vertices of the triangulation. The resulting linear interpolation of these multivariate values yields a multivariate function, called a co-triangulation, that represents all of the dependent data up to the given error tolerance. A simple iterative algorithm for the construction of a co-triangulation from any number of data sets is presented and analyzed. The main contribution of this paper lies in the description of a highly efficient framework for the realization of this approximation algorithm. While the asymptotic time complexity of the algorithm certainly remains within the theoretical bounds, we demonstrate that it is possible to achieve running times that depend only linearly on the number of data even for very large problems with more than two million samples. This efficient realization of the algorithm uses adapted dynamic data structures and careful caching in an integrated framework.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121828612","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
Selective visualization of vortices in hydrodynamic flows 流体动力流动中旋涡的选择性可视化
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.5555/288216.288334
I. Sadarjoen, F. Post, B. Ma, D. Banks, H. Pagendarm
{"title":"Selective visualization of vortices in hydrodynamic flows","authors":"I. Sadarjoen, F. Post, B. Ma, D. Banks, H. Pagendarm","doi":"10.5555/288216.288334","DOIUrl":"https://doi.org/10.5555/288216.288334","url":null,"abstract":"Vortices are important features in many research and engineering fields. Visualization is an important step in gaining more understanding and control of vortices. Vortex detection criteria fall into two categories: point based scalar quantities, calculated at single points, and curve based geometric criteria, calculated for, e.g., streamlines. The first category is easy to compute, but does not work in all cases. The second category is more intuitive and should work in all cases, but currently only works in 2D (or 3D projected) flows. We show applications of both approaches in hydrodynamic flows.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130125305","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}
引用次数: 90
Three-dimensional visualization of microstructures 微观结构的三维可视化
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.1109/VISUAL.1998.745350
M. Lanzagorta, M. Kral, J. Swan, G. Spanos, R. Rosenberg, Eddy Kuo
{"title":"Three-dimensional visualization of microstructures","authors":"M. Lanzagorta, M. Kral, J. Swan, G. Spanos, R. Rosenberg, Eddy Kuo","doi":"10.1109/VISUAL.1998.745350","DOIUrl":"https://doi.org/10.1109/VISUAL.1998.745350","url":null,"abstract":"This case study describes a technique for the three-dimensional analysis of the internal microscopic structure (microstructure) of materials. This technique consists of incrementally polishing through a thin layer (approximately 0.2 /spl mu/m) of material, chemically etching the polished surface, applying reference marks, and performing optical or scanning electron microscopy on selected areas. The series of images are then processed employing AVS and other visualization software to obtain a 3D reconstruction of the material. We describe how we applied this technique to an alloy steel to study the morphology, connectivity, and distribution of cementite precipitates formed during thermal processing. The results showed microstructural features not previously identified with traditional 2D techniques.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123167337","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}
引用次数: 16
Interactive virtual angioscopy 交互式虚拟血管镜检查
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.1109/VISUAL.1998.745337
E. Gobbetti, P. Pili, Antonio Zorcolo, M. Tuveri
{"title":"Interactive virtual angioscopy","authors":"E. Gobbetti, P. Pili, Antonio Zorcolo, M. Tuveri","doi":"10.1109/VISUAL.1998.745337","DOIUrl":"https://doi.org/10.1109/VISUAL.1998.745337","url":null,"abstract":"Virtual angioscopy is a non invasive medical procedure for exploring parts of the human vascular system. We have developed an interactive tool that takes as input, data acquired with standard medical imaging modalities and regards it as a virtual environment to be interactively inspected. The system supports real time navigation with stereoscopic direct volume rendering and dynamic endoscopic camera control, interactive tissue classification, and interactive point picking for morphological feature measurement. We provide an overview of the system, discuss the techniques used in our prototype, and present experimental results on human data sets.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134116957","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}
引用次数: 46
Efficient warping for architectural walkthroughs using layered depth images 使用分层深度图像对建筑演练进行有效的扭曲
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.1109/VISUAL.1998.745305
V. Popescu, A. Lastra, Daniel G. Aliaga, M. M. O. Neto
{"title":"Efficient warping for architectural walkthroughs using layered depth images","authors":"V. Popescu, A. Lastra, Daniel G. Aliaga, M. M. O. Neto","doi":"10.1109/VISUAL.1998.745305","DOIUrl":"https://doi.org/10.1109/VISUAL.1998.745305","url":null,"abstract":"This paper presents efficient image-based rendering techniques used in the context of an architectural walkthrough system. Portals (doors and windows) are rendered by warping layered depth images (LDIs). In a preprocessing phase, for every portal, a number of pre-rendered images are combined into an LDI. The resulting LDI stores, exactly once, all surfaces visible in at least one of the images used in the construction, so most of the exposure errors are efficiently eliminated. The LDI can be warped in the McMillan occlusion compatible ordering. A substantial increase in performance is obtained by warping in parallel. Our parallelization scheme achieves good load balancing, scales with the number of processors, and preserves the occlusion compatible ordering. A fast, conservative reference-image-space clipping algorithm also reduces the warping effort.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123912795","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}
引用次数: 59
Visualizing Hilbert curves 希尔伯特曲线形象化
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.1109/VISUAL.1998.745340
N. Max
{"title":"Visualizing Hilbert curves","authors":"N. Max","doi":"10.1109/VISUAL.1998.745340","DOIUrl":"https://doi.org/10.1109/VISUAL.1998.745340","url":null,"abstract":"A computer animated movie was produced, illustrating both 2D and 3D Hilbert curves, and showing the transition from 2D to 3D with the help of volume rendering.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123199896","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}
引用次数: 15
Level of detail visualization of scalar data sets on irregular surface meshes 不规则表面网格上标量数据集的详细可视化水平
Proceedings Visualization '98 (Cat. No.98CB36276) Pub Date : 1998-10-18 DOI: 10.1109/VISUAL.1998.745287
Georges-Pierre Bonneau, A. Gerussi
{"title":"Level of detail visualization of scalar data sets on irregular surface meshes","authors":"Georges-Pierre Bonneau, A. Gerussi","doi":"10.1109/VISUAL.1998.745287","DOIUrl":"https://doi.org/10.1109/VISUAL.1998.745287","url":null,"abstract":"In this article, we build a multi-resolution framework intended to be used for the visualization of continuous piecewise linear functions defined over triangular planar or spherical meshes. In particular, the data set can be viewed at different level of detail, that's to say as a piecewise linear function defined over any simplification of the base mesh. In his multi-resolution form, the function requires strictly the same volume of data than the original input: It is then possible to go through consecutive levels by the use of so-called detail coefficients, with exact reconstruction if desired. We also show how to choose a decimation sequence that leads to a good compromise between the resulting approximation error and the number of removed vertices. The theoretical tools used here are inspired from wavelet-based techniques and extended in the sense that they can handle non-nested approximation spaces.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"247 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132613223","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}
引用次数: 16
首页 上一页 下一页 尾页
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学术官方微信