IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003.最新文献

Efficient parallel out-of-core isosurface extraction 高效平行岩心外等值面提取

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1109/PVGS.2003.1249036

Huijuan Zhang, Timothy S Newman

引用次数: 21

A multilayered image cache for scientific visualization 用于科学可视化的多层图像缓存

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1117/12.539259

E. LaMar, Valerio Pascucci

引用次数: 17

From cluster to wall with VTK 从集群到墙壁与VTK

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1109/PVGS.2003.1249039

K. Moreland, D. Thompson

引用次数: 25

The feature tree: visualizing feature tracking in distributed AMR datasets 特征树:在分布式AMR数据集中可视化特征跟踪

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1109/PVGS.2003.1249048

Jing Chen, D. Silver, Lian Jiang

引用次数: 37

A parallel framework for simplification of massive meshes 一种用于大规模网格简化的并行框架

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1109/PVGS.2003.1249038

D. Brodsky, J. Pedersen

引用次数: 8

Distributed interactive ray tracing for large volume visualization 面向大体积可视化的分布式交互光线追踪

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1109/PVGS.2003.1249046

David E. DeMarle, S. Parker, M. Hartner, C. Gribble, C. Hansen

{"title":"Distributed interactive ray tracing for large volume visualization","authors":"David E. DeMarle, S. Parker, M. Hartner, C. Gribble, C. Hansen","doi":"10.1109/PVGS.2003.1249046","DOIUrl":"https://doi.org/10.1109/PVGS.2003.1249046","url":null,"abstract":"We have constructed a distributed parallel ray tracing system that interactively produces isosurface renderings from large data sets on a cluster of commodity PCs. The program was derived from the SCI Institute's interactive ray tracer (*-Ray), which utilizes small to large shared memory platforms, such as the SGI Origin series, to interact with very large-scale data sets. Making this approach work efficiently on a cluster requires attention to numerous system-level issues, especially when rendering data sets larger than the address space of each cluster node. The rendering engine is an image parallel ray tracer with a supervisor/workers organization. Each node in the cluster runs a multithreaded application. A minimal abstraction layer on top of TCP links the nodes, and enables asynchronous message handling. For large volumes, render threads obtain data bricks on demand from an object-based software distributed shared memory. Caching improves performance by reducing the amount of data transfers for a reasonable working set size. For large data sets, the cluster-based interactive ray tracer performs comparably with an SGI Origin system. We examine the parameter space of the renderer and provide experimental results for interactive rendering of large (7.5 GB) data sets.","PeriodicalId":307148,"journal":{"name":"IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003.","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128608643","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}

引用次数: 86

SLIC: scheduled linear image compositing for parallel volume rendering SLIC:用于并行体绘制的预定线性图像合成

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1109/PVGS.2003.1249040

Aleksander Stompel, K. Ma, E. Lum, J. Ahrens, J. Patchett

引用次数: 86

Parallel cell projection rendering of adaptive mesh refinement data 自适应网格细化数据的并行单元投影绘制

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1109/PVGS.2003.1249042

G. Weber, Martin Öhler, O. Kreylos, J. Shalf, E. W. Bethel, B. Hamann, G. Scheuermann

引用次数: 11

Improving occlusion query efficiency with occupancy maps 提高占用地图遮挡查询效率

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1109/PVGS.2003.1249049

Dirk Staneker, D. Bartz, M. Meissner

{"title":"Improving occlusion query efficiency with occupancy maps","authors":"Dirk Staneker, D. Bartz, M. Meissner","doi":"10.1109/PVGS.2003.1249049","DOIUrl":"https://doi.org/10.1109/PVGS.2003.1249049","url":null,"abstract":"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.","PeriodicalId":307148,"journal":{"name":"IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127543458","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}

引用次数: 29

Real-time volume rendering of time-varying data using a fragment-shader compression approach 使用碎片着色器压缩方法对时变数据进行实时体渲染

IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. Pub Date : 2003-10-20 DOI: 10.1109/PVGS.2003.1249044

A. Binotto, J. Comba, C. Freitas

引用次数: 37