2000 IEEE Symposium on Volume Visualization (VV 2000)最新文献

Accelerating Time-Varying Hardware Volume Rendering Using TSP Trees and Color-Based Error Metrics 使用TSP树和基于颜色的错误度量加速时变硬件体绘制

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353908

Han-Wei Shen, Ling-Jen Chiang, D. Ellsworth

引用次数: 72

Volumetric Backprojection 体积投影

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353907

F. Dachille, K. Mueller, A. Kaufman

引用次数: 10

Time Critical Isosurface Refinement and Smoothing 时间临界等值面细化和平滑

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353894

Valerio Pascucci, C. Bajaj

{"title":"Time Critical Isosurface Refinement and Smoothing","authors":"Valerio Pascucci, C. Bajaj","doi":"10.1145/353888.353894","DOIUrl":"https://doi.org/10.1145/353888.353894","url":null,"abstract":"Multi-resolution data-structures and algorithms are key in Visualization to achieve real-time interaction with large data-sets. Research has been primarily focused on the off-line construction of such representations mostly using decimation schemes. Drawbacks of this class of approaches include: (i) the inability to maintain interactivity when the displayed surface changes frequently, (ii) inability to control the global geometry of the embedding (no self-intersections) of any approximated level of detail of the output surface. In this paper we introduce a technique for on-line construction and smoothing of progressive isosurfaces (see Figure 1). Our hybrid approach combines the flexibility of a progressive multi-resolution representation with the advantages of a recursive subdivision scheme. Our main contributions are: (i) a progressive algorithm that builds a multi-resolution surface by successive refinements so that a coarse representation of the output is generated as soon as a coarse representation of the input is provided, (ii) application of the same scheme to smooth the surface by means of a 3D recursive subdivision rule, (iii) a multi-resolution representation where any adaptively selected level of detail surface is guaranteed to be free of self-intersections.","PeriodicalId":189891,"journal":{"name":"2000 IEEE Symposium on Volume Visualization (VV 2000)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129255132","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}

引用次数: 42

4D Volume Rendering with the Shear Warp Factorisation 四维体渲染与剪切扭曲分解

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353909

Kostas Anagnostou, T. Atherton, Andrew E. Waterfall

引用次数: 38

ZSWEEP: An Efficient and Exact Projection Algorithm for Unstructured Volume Rendering ZSWEEP:一种高效、精确的非结构化体绘制投影算法

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353905

R. Farias, Joseph S. B. Mitchell, Cláudio T. Silva

{"title":"ZSWEEP: An Efficient and Exact Projection Algorithm for Unstructured Volume Rendering","authors":"R. Farias, Joseph S. B. Mitchell, Cláudio T. Silva","doi":"10.1145/353888.353905","DOIUrl":"https://doi.org/10.1145/353888.353905","url":null,"abstract":"We present a simple new algorithm that performs fast and memory-efficient cell projection for (exact) rendering of unstructured datasets. The main idea of the \"ZSweep\" algorithm is very simple; it is based on sweeping the data with a plane parallel to the viewing plane, in order of increasing z, projecting the faces of cells that are incident to vertices as they are encountered by the sweep plane. The efficiency arises from the fact that the algorithm exploits the implicit (approximate) global ordering that the z-ordering of the vertices induces on the cells that are incident on them. The algorithm projects cells by projecting each of their faces, with special care taken to avoid double projection of internal faces and to assure correctness in the projection order. The contribution for each pixel is computed in stages, during the sweep, using a short list of ordered face intersections, which is known to be correct and complete at the instant that each stage of the computation is completed. The ZSweep algorithm is simple enough to be readily adaptable to general (non-tetrahedral) cell formats. It is memory efficient, since its auxiliary data structures have only to store partial information taken from a small number of \"slices\" of the dataset. We also introduce a simple technique of data sparsification, which may be of interest in its own right. Our implementation is hardware-independent and handles datasets containing tetrahedral and/or hexahedral cells. We give experimental evidence that our method is competitive, up to 5 times faster than the best previously-known exact algorithms that use comparable amounts of memory, while using much less memory than ray-casting.","PeriodicalId":189891,"journal":{"name":"2000 IEEE Symposium on Volume Visualization (VV 2000)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127833901","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

Volume Scene Graphs 体景图

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353898

David R. Nadeau

引用次数: 47

Mastering Windows: Improving Reconstruction 掌握Windows:改进重建

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353906

T. Theußl, H. Hauser, E. Gröller

引用次数: 69

Fast CSG Voxelization by Frame Buffer Pixel Mapping 基于帧缓冲像素映射的快速CSG体素化

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353896

S. Fang, Duoduo Liao

引用次数: 44

A Practical Evaluation of Popular Volume Rendering Algorithms 流行体绘制算法的实用评价

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353903

M. Meissner, Jian Huang, D. Bartz, K. Mueller, R. Crawfis

引用次数: 230

Reducing Aliasing Artifacts in Iso-Surfaces of Binary Volumes 减少二值体等面中的混叠伪影

2000 IEEE Symposium on Volume Visualization (VV 2000) Pub Date : 2000-10-09 DOI: 10.1145/353888.353893

R. Whitaker

{"title":"Reducing Aliasing Artifacts in Iso-Surfaces of Binary Volumes","authors":"R. Whitaker","doi":"10.1145/353888.353893","DOIUrl":"https://doi.org/10.1145/353888.353893","url":null,"abstract":"This paper presents a method for filtering binary volumes in order to reduce the aliasing artifacts that typically result when trying to visualize the surfaces described by such a binary partitioning. The proposed method is a reformulation of the technique of constrained elastic surface nets from the literature. The strategy is to estimate a 3D surface using an iterative relaxation process, which finds the surface of minimal area while treating the binary input data as a set of constraints. Unlike surface nets, the proposed method does not require the generation of any explicit surface representation; it acts directly on the volume. This is done by treating the level sets of the volume as deformable surfaces moving under a mean curvature flow constrained by a discretely sampled inside/outside function. Because the proposed method does not require generating a surface mesh, it avoids the various singularities and topological problems associated with iso-surface generation. It also avoids the artifacts that an irregular mesh topology can produce in deformation processes. If the goal is volume rendering, the proposed method avoids the time consuming process of converting surface meshes back into volumes.","PeriodicalId":189891,"journal":{"name":"2000 IEEE Symposium on Volume Visualization (VV 2000)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125749266","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}

引用次数: 76