检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

51 篇 会议
3 篇 期刊文献

馆藏范围

54 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

18 篇 工学
- 16 篇 计算机科学与技术...
- 14 篇 软件工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 电气工程
- 1 篇 控制科学与工程
- 1 篇 测绘科学与技术
4 篇 理学
- 3 篇 数学
- 2 篇 物理学
- 1 篇 地球物理学
- 1 篇 统计学（可授理学、...
1 篇 医学
- 1 篇 临床医学

主题

19 篇 rendering (compu...
19 篇 data visualizati...
16 篇 computer graphic...
14 篇 hardware
9 篇 parallel process...
9 篇 concurrent compu...
9 篇 computational mo...
9 篇 visualization
8 篇 application soft...
8 篇 graphics
7 篇 chromium
6 篇 costs
6 篇 load management
6 篇 layout
5 篇 data mining
5 篇 displays
5 篇 isosurfaces
5 篇 solid modeling
5 篇 large-scale syst...
5 篇 partitioning alg...

机构

3 篇 university of ca...
2 篇 aist
2 篇 sandia national ...
1 篇 lawrence berkele...
1 篇 department of el...
1 篇 department of co...
1 篇 ohio state uinve...
1 篇 eberhard karls u...
1 篇 department of el...
1 篇 school of comput...
1 篇 univ alabama dep...
1 篇 clearspeed techn...
1 篇 albuquerque high...
1 篇 sandia natl labs...
1 篇 princeton univer...
1 篇 wsi gris univers...
1 篇 los alamos natio...
1 篇 sandia national ...
1 篇 university of te...
1 篇 lawrence livemor...

作者

2 篇 takama yasufumi
2 篇 wakabayashi hiro...
2 篇 k. moreland
2 篇 b. hamann
2 篇 m. meissner
2 篇 w. strasser
2 篇 tanaka hiromi t.
2 篇 f. bensaali
2 篇 han-wei shen
2 篇 ma kl
2 篇 d. bartz
2 篇 c.t. silva
2 篇 a. amira
2 篇 d. staneker
2 篇 e.w. bethel
2 篇 jinzhu gao
2 篇 lum eb
2 篇 bethel ew
1 篇 d. breen
1 篇 muraki s

语言

54 篇 英文

检索条件"任意字段=IEEE Symposium on Parallel and Large-Data Visualization and Graphics 2003, PVG 2003"

共 54 条记录，以下是21-30 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

The feature tree: visualizing feature tracking in distributed AMR datasets

The feature tree: visualizing feature tracking in distribute...

引用

ieee symposium on parallel and large-data visualization and graphics (pvg)

作者： J. Chen D. Silver L. Jiang Department of Electrical and Computer Engineering Rutgers University Piscataway NJ USA

We describe a feature extraction and tracking algorithm for AMR (adaptive mesh refinement) datasets that operates within a distributed computing environment. Because features can span multiple refinement levels and multiple processors, tracking must be performed across time, across levels, and across processors. The resulting visualization is represented as a "feature tree". A feature contains multiple parts corresponding to different levels of refinements. The feature tree allows a viewer to determine that a feature splits or merges at the next refinement level, and allows a viewer to extract and isolate a multilevel isosurface and watch how that surface changes over both time and space. The algorithm is implemented within a computational steering environment, which enables the visualization routines to operate on the data in-situ (while the simulation is ongoing).

关键词： Adaptive mesh refinement Feature extraction data visualization Computational modeling Silver Isosurfaces Computer graphics data mining Problem-solving Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Sort-first, distributed memory parallel visualization and rendering

Sort-first, distributed memory parallel visualization and re...

引用

ieee symposium on parallel and large-data visualization and graphics (pvg)

作者： E.W. Bethel G. Humphreys B. Paul J.D. Brederson Lawrence Berkeley National Laboratory Berkeley CA USA Department of Computer Science University of Virginia Charlottesville VA USA Tungsten Graphics Inc. Cedar Park TX USA Scientific Computing and Imaging Institute University of Utah Salt Lake UT USA

While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpose parallel visualization and graphics. We describe the results of a recent project that provides a software infrastructure suitable for general-purpose use by parallel visualization and graphics applications. Our work combines and extends two technologies: chromium, a stream-oriented framework that implements the OpenGL programming interface; and OpenRM scene graph, a pipelined-parallel scene graph interface for graphics data management. Using this combination, we implement a sort-first, distributed memory, parallel volume rendering application. We describe the performance characteristics in terms of bandwidth requirements and highlight key algorithmic considerations needed to implement the sort-first system. We characterize system performance using a distributed memory parallel volume rendering application, and present performance gains realized by using scene specific knowledge to accelerate rendering by reducing network traffic. The contribution of this work is an exploration of general-purpose, sort-first architecture performance characteristics as applied to distributed memory, commodity hardware, along with a description of the algorithmic support needed to realize parallel, sort-first implementations.

关键词： graphics Rendering (computer graphics) Layout Hardware Concurrent computing Costs data visualization Application software Chromium Technology management

来源：评论

学校读者我要写书评

暂无评论

Distributed interactive ray tracing of dynamic scenes

Distributed interactive ray tracing of dynamic scenes

引用

ieee symposium on parallel and large-data visualization and graphics (pvg)

作者： I. Wald C. Benthin P. Slusallek Computer Graphics Group Saarland University USA

Recently developed interactive ray tracing systems combine the high performance of todays CPUs with new algorithms and implementations to achieve a flexible and high-performance rendering system offering high-quality, but nonetheless interactive 3D graphics. However, due to its history in offline rendering, interactive ray tracing is usually limited to static scenes and simple walkthroughs. In order to become truly interactive ray tracing must efficiently support dynamic scenes. We present a simple and practical method that allows to interactively ray trace dynamic scenes in a distributed PC cluster environment. Our method separates the scene into independent objects with common properties concerning dynamic updates - similar to OpenGL display lists and scene graph libraries. Three classes of objects are distinguished: static objects are treated as before, objects undergoing affine transformations are handled by transforming rays, and objects with unstructured motion are rebuilt whenever necessary. We present performance and scalability results of our system using a variety of test scenes stressing a wide range of dynamic behaviour.

关键词： Ray tracing Layout Rendering (computer graphics) graphics History Displays Libraries Scalability System testing Dynamic range

来源：评论

学校读者我要写书评

暂无评论

parallel cell projection rendering of adaptive mesh refinement data

Parallel cell projection rendering of adaptive mesh refineme...

引用

ieee symposium on parallel and large-data visualization and graphics (pvg)

作者： G.H. Weber M. Ohler O. Kreylos J.M. Shalf E.W. Bethel B. Hamann G. Scheuermann Visualization Group National Energy Research Scientific Computing Center (NERSC) Lawrence Berkeley National Laboratory Berkeley CA USA AG Graphische Datenverabeitung und Computergeometrie FB Informatik University of Kaiserslautern Kaiserslautern Germany Center for Image Processing and Integrated Computing Center for Image Processing and Integrated Computing (CIPIC) Department of Computer Science University of California Davis CA USA Center for Image Processing and Integrated Computing Department of Computer Science University of California Davis CA USA

Adaptive mesh refinement (AMR) is a technique used in numerical simulations to automatically refine (or de-refine) certain regions of the physical domain in a finite difference calculation. AMR data consists of nested hierarchies of data grids. As AMR visualization is still a relatively unexplored topic, our work is motivated by the need to perform efficient visualization of large AMR data sets. We present a software algorithm for parallel direct volume rendering of AMR data using a cell-projection technique on several different parallel platforms. Our algorithm can use one of several different distribution methods, and we present performance results for each of these alternative approaches. By partitioning an AMR data set into blocks of constant resolution and estimating rendering costs of individual blocks using an application specific benchmark, it is possible to achieve even load balancing.

关键词： Adaptive mesh refinement data visualization Rendering (computer graphics) Spatial resolution Partitioning algorithms Load management parallel programming graphics Physics computing Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Improving occlusion query efficiency with occupancy maps

Improving occlusion query efficiency with occupancy maps

引用

ieee symposium on parallel and large-data visualization and graphics (pvg)

作者： D. Staneker D. Bartz M. Meissner WSI GRIS University of Tubingen Germany WSI/GRIS University of Tiibingen Germany Eberhard Karls Universitat Tubingen Tubingen Baden-WÃ¼rttemberg DE Tubingen Univ. Germany

Image space occlusion culling is an useful approach to reduce the rendering load of large polygonal models. Like most large model techniques, it trades overhead costs with the rendering costs of the possibly occluded geometry. Meanwhile, modern graphics hardware supports occlusion culling, whereas they associate a significant query overhead, which hurts in particular, if the occlusion culling query itself was unsuccessful. We propose the occupancy map - a compact, cache-optimized representation of coverage information - to reduce the number of costly but unsuccessful occlusion culling queries and to arrange multiple occlusion queries. The information of the occupancy map is used to skip an occlusion query, if the respective map area is not yet set $the respective area has not yet received rendered pixels -, hence an occlusion query would always return not occluded. The remaining occlusion information is efficiently determined by asynchronous multiple occlusion queries with hardware-supported query functionality. To avoid redundant results, we arrange these multiple occlusion queries according to the information of several occupancy maps. Our presented technique is conservative and benefits from a partial depth order of the geometry.

关键词： graphics Geometry Hardware Rendering (computer graphics) Costs Solid modeling Packaging Sampling methods Layout Chromium

来源：评论

学校读者我要写书评

暂无评论

Study and implementation on parallel processing algorithm for DEPS

Study and implementation on parallel processing algorithm fo...

引用

23rd International Geoscience and Remote Sensing symposium (IGARSS 2003)

作者： Zhu, LF Shao, Y Fan, XT Guo, HD Chinese Acad Sci Inst Remote Sensing Applicat Lab Digital Earth Sci Beijing 100101 Peoples R China

ISBN: (纸本)0780379292

A study on efficient visualization and real-time interactivity of large-scale scenes was discussed in this paper. Introducing the parallel processing technology, we present a paralletizable strategy with the pipeline algorithm, realize this parallel algorithm based on shared-memory, and then apply this program to Test Site, Peking Olympic Games planning mixed scenes, including real-time rendering, dynamically textures loading, quickly browsing and so on. The results show a running performance and real-time interactivity improvement of DEPS when using this algorithm. The parallel program of this paper was developed and running on a Silicon graphics multiprocessor, Onyx 3200, with four MIPS R12000 processors and InfiniteReality3 graphic accelerator, under IRIX 6.5 operating system.

关键词： virtual environment real-time simulation parallel processing shared-memory model

来源：评论

学校读者我要写书评

暂无评论

Proceedings ieee 2001 symposium on parallel and large-data visualization and graphics (Cat. No.01EX520)

Proceedings IEEE 2001 Symposium on Parallel and Large-Data V...

引用

ieee symposium on parallel and large-data visualization and graphics (pvg)

Presents the front cover of the proceedings record.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 2003 Eurographics/ieee TVCG Workshop on Volume graphics, VG '03

Proceedings of the 2003 Eurographics/IEEE TVCG Workshop on V...

引用

2003 Eurographics/ieee TVCG Workshop on Volume graphics, VG '03

ISBN: (纸本)1581137451

The proceedings contain 16 papers. The topics discussed include: rapid emission tomography reconstruction;chronovolumes: a direct rendering technique for visualizing time-varying data;spatial transfer functions: a unified approach to specifying deformation in volume modeling and animation;real-time volume manipulation;volumetric ablation rendering;the design and evaluation of a pipelined image compositing device for massively parallel volume rendering;OpenVL: the open volume library;accuracy-based sampling and reconstruction with adaptive grid for parallel hierarchical tetrahedrization;multiresolution volume simplification and polygonization;out-of-core encoding of large tetrahedral meshes;cell projection of convex polyhedra;hybrid forward resampling and volume rendering;and an interactive volume visualization system for transient flow analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Visibility Culling Using Plenoptic Opacity Functions for large Volume visualization

Visibility Culling Using Plenoptic Opacity Functions for Lar...

引用

VIS 2003 PROCEEDINGS

作者： Gao, Jinzhu Huang, Jian Shen, Han-Wei Kohl, James Arthur Oak Ridge National Lab Oak Ridge TN United States

Visibility culling has the potential to accelerate large data visualization in significant ways. Unfortunately, existing algorithms do not scale well when parallelized, and require full re-computation whenever the opacity transfer function is modified. To address these issues, we have designed a Plenoptic Opacity Function (POF) scheme to encode the view-dependent opacity of a volume block. POFs are computed off-line during a pre-processing stage, only once for each block. We show that using POFs is (i) an efficient, conservative and effective way to encode the opacity variations of a volume block for a range of views, (ii) flexible for re-use by a family of opacity transfer functions without the need for additional off-line processing, and (iii) highly scalable for use in massively parallel implementations. Our results confirm the efficacy of POFs for visibility culling in large-scale parallel volume rendering;we can interactively render the Visible Woman dataset using software ray-casting on 32 processors, with interactive modification of the opacity transfer function on-the-fly.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

Accuracy-based sampling and reconstruction with adaptive grid for parallel hierarchical tetrahedrization

Accuracy-based sampling and reconstruction with adaptive gri...

引用

Volume graphics 2003, Third Intenational Workshop on Volume graphics

作者： Tanaka, Hiromi T. Takama, Yasufumi Wakabayashi, Hiroki Computer Vision Laboratory Department of Computer Science Ritsumeikan University Noji-Higashi 1 chome 1-1 Kusatsu Shiga 525-8577 Japan

ISBN: (纸本)1581137451

Recent advances in volume scanning techniques have made the task of acquiring volume data of 3-D objects easier and more accurate. Since the quantity of such acquired data is generally very large, a volume model capable of compressing data while maintaining a specified accuracy is required. The objective of this work is to construct a multi resolution tetrahedra representation of input volume data. This representation adapts to local field properties while preserving their discontinuities. In this paper, we present an accuracy-based adaptive sampling and reconstruction technique, we call an adaptive grid, for hierarchical tetrahedrization of C1 continuous volume data. We have developed a parallel algorithm of adaptive grid generation that recursively bisects tetrahedra gird elements by increasing the number of grid nodes, according to local field properties and such as orientation and curvature of isosurfaces, until the entire volume has been approximated within a specified level of view-invariant accuracy. We have also developed a parallel algorithm that detects and presents both C0 and C1 discontinuities of field values, without the formation of cracks which normally occur during independent subdivision. Experimental results demonstrate the validity and effusiveness of the proposed approach.

关键词： Computer graphics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共6页 << < 1 2 3 4 5 6 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：