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

Domino Tiling:A New Method of Real-Time Conforming Mesh Construction for Rendering Changeable Height Fields

Journal of Computer Science & Technology 2011年第6期26卷 971-987页

作者： Dorde M. Durdevi Igor I. Tartalja School of Electrical Engineering University of Belgrade

In this paper we present a novel GPU-oriented method of creating an inherently continuous triangular mesh for tile-based rendering of regular height fields. The method is based on tiling data-independent semi-regular meshes of non-uniform structure, a technique that is quite different from other mesh tiling approaches. A complete, memory efficient set of mesh patterns is created by an off-line procedure and stored into the graphics adapter＇s memory at runtime. At rendering time, for each tile, one of the precomputed mesh patterns is selected for rendering. The selected mesh pattern fits the required level of details of the tile and ensures seamless connection with other adjacent mesh patterns, like in a game of dominoes. The scalability potential of the proposed method is demonstrated through quadtree hierarchical grouping of tiles. The efficiency is verified by experimental results on height fields for terrain representation, where the method achieves high frame rates and sustained triangle throughput on high resolution viewports with sub-pixel error tolerance. Frame rate sensitivity to real-time modifications of the height field is measured, and it is shown that the method is very tolerant and consequently well tailored for applications dealing with rapidly changeable phenomena represented by height fields.

关键词： graphics data structures and data types height field surface representation level of details real-time heightfield manipulation view-dependent rendering

来源：评论

学校读者我要写书评

暂无评论

Optimal Path Maps on the GPU

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER graphics 2020年第9期26卷 2863-2874页

作者： Farias, Renato Kallmann, Marcelo Univ Calif Comp Sci & Engn Dept Merced CA 95343 USA

We introduce a new method for computing optimal path maps on the GPU using OpenGL shaders. Our method explores GPU rasterization as a way to propagate optimal costs on a polygonal 2D environment, producing optimal path maps which can efficiently be queried at run-time. Our method is implemented entirely with GPU shaders, does not require pre-computation, addresses optimal path maps with multiple points and line segments as sources, and introduces a new optimal path map concept not addressed before: maps with weights at vertices representing possible changes in traversal speed. The produced maps offer new capabilities not explored by previous navigation representations and at the same time address paths with global optimality, a characteristic which has been mostly neglected in animated virtual environments. The proposed path maps partition the input environment into the regions sharing a same parent point along the shortest path to the closest source, taking into account possible speed changes at vertices. The proposed approach is particularly suitable for the animation of multiple agents moving toward the entrances or exits of a virtual environment, a situation which is efficiently represented with the proposed path maps.

关键词： graphics processing units Path planning Microsoft Windows Geometry Navigation Virtual environments Computational efficiency graphics data structures and data types path planning shortest path maps navigation GPU programming

来源：评论

学校读者我要写书评

暂无评论

Spatial Matching of Animated Meshes

引用

COMPUTER graphics FORUM 2016年第7期35卷 21-32页

作者： Seo, H. Cordier, F. Univ Strasbourg ICube Strasbourg France Univ Haute Alsace LMIA Mulhouse France

This paper presents a new technique which makes use of deformation and motion properties between animated meshes for finding their spatial correspondences. Given a pair of animated meshes exhibiting a semantically similar motion, we compute a sparse set of feature points on each mesh and compute spatial correspondences among them so that points with similar motion behavior are put in correspondence. At the core of our technique is our new, dynamic feature descriptor named AnimHOG, which encodes local deformation characteristics. AnimHOG is ob-tained by computing the gradient of a scalar field inside the spatiotemporal neighborhood of a point of interest, where the scalar values are obtained from the deformation characteristic associated with each vertex and at each frame. The final matching has been formulated as a discreet optimization problem that finds the matching of each feature point on the source mesh so that the descriptor similarity between the corresponding feature pairs as well as compatibility and consistency as measured across the pairs of correspondences are maximized. Consequently, reliable correspondences can be found even among the meshes of very different shape, as long as their motions are similar. We demonstrate the performance of our technique by showing the good quality of matching results we obtained on a number of animated mesh pairs.

关键词： Categories and Subject Descriptors (according to ACM CCS) I.3.5 [Computer graphics]: Computational Geometry and Object Modeling&mdash Geometric algorithms languages and systems I.3.6 [Computer graphics]: Methodology and Techniques&mdash graphics data structures and data types I.3.7 [Computer graphics]: Three-Dimensional graphics and Realism&mdash Animation

来源：评论

学校读者我要写书评

暂无评论

Interactive Global Photon Mapping

引用

COMPUTER graphics FORUM 2009年第4期28卷 1151-1159页

作者： Fabianowski, B. Dingliana, J. Trinity Coll Dublin GV2 Grp Dublin Ireland

We present a photon mapping technique capable of computing high quality global illumination at interactive frame rates. By extending the concept of photon differentials to efficiently handle diffuse reflections, we generate footprints at all photon hit points. These enable illumination reconstruction by density estimation with variable kernel bandwidths without having to locate the k nearest photon hits first. Adapting an efficient BVH construction process for ray tracing acceleration, we build photon maps that enable the fast retrieval of all hits relevant to a shading point. We present a heuristic that automatically times the BVH build's termination criterion to the scene and illumination conditions. As all stages of the algorithm are highly parallelizable, we demonstrate an implementation using NVidia's CUDA manycore architecture running at interactive rates on a single GPU. Both light source and camera may be freely moved with global illumination fully recalculated in each frame.

关键词： I.3.7 [Computer graphics]: Three-Dimensional graphics and Realism Color shading shadowing and texture I.3.6 [Computer graphics]: Methodology and Techniques— graphics data structures and data types

来源：评论

学校读者我要写书评

暂无评论

PaperVis: Literature Review Made Easy

引用

COMPUTER graphics FORUM 2011年第3期30卷 721-730页

作者： Chou, J. -K. Yang, C. -K. Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei Taiwan

Reviewing literatures for a certain research field is always important for academics. One could use Google-like information seeking tools, but oftentimes he/she would end up obtaining too many possibly related papers, as well as the papers in the associated citation network. During such a process, a user may easily get lost after following a few links for searching or cross-referencing. It is also difficult for the user to identify relevant/important papers from the resulting huge collection of papers. Our work, called PaperVis, endeavors to provide a user-friendly interface to help users quickly grasp the intrinsic complex citation-reference structures among a specific group of papers. We modify the existing Radial Space Filling (RSF) and Bullseye View techniques to arrange involved papers as a node-link graph that better depicts the relationships among them while saving the screen space at the same time. PaperVis applies visual cues to present node attributes and their transitions among interactions, and it categorizes papers into semantically meaningful hierarchies to facilitate ensuing literature exploration. We conduct experiments on the InfoVis 2004 Contest dataset to demonstrate the effectiveness of PaperVis.

关键词： I.3.3 [Computer graphics]: Picture/Image Generation Line and curve generation I.3.6 [Computer graphics]: Methodology and Techniques graphics data structures and data types

来源：评论

学校读者我要写书评

暂无评论

QuadStack: An Efficient Representation and Direct Rendering of Layered datasets

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER graphics 2021年第9期27卷 3733-3744页

作者： Graciano, Alejandro Rueda, Antonio J. Pospisil, Adam Bittner, Jiri Benes, Bedrich Univ Jaen Jaen 23071 Spain Univ Jaen Escuela Politecn Super Comp Sci Jaen 23071 Spain Czech Tech Univ Prague 16636 6 Czech Republic Purdue Univ Technol W Lafayette IN 47907 USA Purdue Univ Comp Sci W Lafayette IN 47907 USA

We introduce QuadStack, a novel algorithm for volumetric data compression and direct rendering. Our algorithm exploits the data redundancy often found in layered datasets which are common in science and engineering fields such as geology, biology, mechanical engineering, medicine, etc. QuadStack first compresses the volumetric data into vertical stacks which are then compressed into a quadtree that identifies and represents the layered structures at the internal nodes. The associated data (color, material, density, etc.) and shape of these layer structures are decoupled and encoded independently, leading to high compression rates (4x to 54x of the original voxel model memory footprint in our experiments). We also introduce an algorithm for value retrieving from the QuadStack representation and we show that the access has logarithmic complexity. Because of the fast access, QuadStack is suitable for efficient data representation and direct rendering. We show that our GPU implementation performs comparably in speed with the state-of-the-art algorithms (18-79 MRays/s in our implementation), while maintaining a significantly smaller memory footprint.

关键词： Rendering (computer graphics) data visualization graphics processing units data models Geology data structures Ray tracing Computer graphics object hierarchies graphics data structures and data types

来源：评论

学校读者我要写书评

暂无评论

Stick textures for image-based rendering

引用

GRAPHICAL MODELS 2006年第3期68卷 294-306页

作者： Wang, Wencheng Li, Kuiyu Wu, Enhua Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing 100080 Peoples R China Univ Macau Fac S&T Dept Comp & Informat Sci Macau Peoples R China

This paper presents a new data structure, called stick textures, to give a continuous and compact 3D representation of the scene displayed in depth images. A stick texture is constructed for each pixel of a depth image, composed of the interpolated pixels to fill the gaps between the pixel and its neighbour pixels covered by a same continuous surface. Thus, rendering sticks instead of pixels can save operations on hole-filling for acceleration, and produce high quality novel images with 3D details and view motion parallax displayed very well. In addition, stick textures are always short, and every stick texture can be rendered as a pixel. Therefore, stick textures have not a high storage requirement, and they can be easily integrated with existing image-based rendering methods to achieve high rendering efficiency, e.g., using GPUs for acceleration and conveniently handling large-scale scenes, even the scenes with multi-layered objects. Experimental results demonstrate the advantages of stick textures in image quality, rendering speed and storage requirement. (c) 2006 Elsevier Inc. All rights reserved.

关键词： graphics data structures and data types graphics processors image-based rendering object representation

来源：评论

学校读者我要写书评

暂无评论

Out-of-core selection and editing of huge point clouds

引用

COMPUTERS & graphics-UK 2011年第2期35卷 342-351页

作者： Scheiblauer, Claus Wimmer, Michael Inst Comp Graph & Algorithms A-1040 Vienna Austria

In this paper we present an out-of-core editing system for point clouds, which allows selecting and modifying arbitrary parts of a huge point cloud interactively. We can use the selections to segment the point cloud, to delete points, or to render a preview of the model without the points in the selections. Furthermore, we allow for inserting points into an already existing point cloud. All operations are conducted on a rendering optimized data structure that uses the raw point cloud from a laser scanner, and no additionally created points are needed for an efficient level-of-detail (LOD) representation using this data structure. We also propose an algorithm to alleviate the artifacts when rendering a point cloud with large discrepancies in density in different areas by estimating point sizes heuristically. These estimated point sizes can be used to mimic a closed surface on the raw point cloud, also when the point cloud is composed of several raw laser scans. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Point-based rendering Viewing algorithms graphics data structures and data types

来源：评论

学校读者我要写书评

暂无评论

Decoupled Space and Time Sampling of Motion and Defocus Blur for Unified Rendering of Transparent and Opaque Objects

引用

COMPUTER graphics FORUM 2016年第7期35卷 441-450页

作者： Widmer, S. Wodniok, D. Thul, D. Guthe, S. Goesele, M. Tech Univ Darmstadt Grad Sch Computat Engn Darmstadt Germany Tech Univ Darmstadt Darmstadt Germany

We propose a unified rendering approach that jointly handles motion and defocus blur for transparent and opaque objects at interactive frame rates. Our key idea is to create a sampled representation of all parts of the scene geometry that are potentially visible at any point in time for the duration of a frame in an initial rasterization step. We store the resulting temporally-varying fragments (t-fragments) in a bounding volume hierarchy which is rebuild every frame using a fast spatial median construction algorithm. This makes our approach suitable for interactive applications with dynamic scenes and animations. Next, we perform spatial sampling to determine all t-fragments that intersect with a specific viewing ray at any point in time. Viewing rays are sampled according to the lens uv-sampling for depth-of-field effects. In a final temporal sampling step, we evaluate the predetermined viewing ray/t-fragment intersections for one or multiple points in time. This allows us to incorporate all standard shading effects including transparency. We describe the overall framework, present our GPU implementation, and evaluate our rendering approach with respect to scalability, quality, and performance.

关键词： Categories and Subject Descriptors (according to ACM CCS) I.3.6 [Computer graphics]: Methodology and Techniques&mdash graphics data structures and data types I.3.7 [Computer graphics]: Three-Dimensional graphics and Realism&mdash Raytracing

来源：评论

学校读者我要写书评

暂无评论

Networks of Names: Visual Exploration and Semi-Automatic Tagging of Social Networks from Newspaper Articles

引用

COMPUTER graphics FORUM 2014年第3期33卷 211-220页

作者： Kochtchi, A. von Landesberger, T. Biemann, C. Tech Univ Darmstadt Language Technol Grp Darmstadt Germany Tech Univ Darmstadt Interact Graph Syst Grp Darmstadt Germany

Understanding relationships between people and organizations by reading newspaper articles is difficult to manage for humans due to the large amount of data. To address this problem, we present and evaluate a new visual analytics system, which offers interactive exploration and tagging of social networks extracted from newspapers. For the visual exploration of the network, we extract "interesting" neighbourhoods of nodes, using a new degree of interest (DOI) measure based on edges instead of nodes. It improves the seminal definition of DOI, which we find to produce the same "globally interesting" neighbourhoods in our use case, regardless of the query. Our approach allows answering different user queries appropriately, avoiding uniform search results. We propose a user-driven pattern-based classifier for discovery and tagging of non-taxonomic semantic relations. Our approach does not require any a-priori user knowledge, such as expertise in syntax or pattern creation. An evaluation shows that our classifier is capable of identifying known lexico-syntactic patterns as well as various domain-specific patters. Our classifier yields good results already with a small amount of training, and continuously improves through user feedback. We conduct a user study to evaluate whether our visual interactive system has an impact on how users tag relationships, as compared to traditional text-based interfaces. Study results suggest that users of the visual system tend to tag more concisely, avoiding too abstract or overly specific relationship labels.

关键词： Categories and Subject Descriptors (according to ACM CCS) H.5.2 [Information Interfaces and Presentation]: User Interfaces (D.2.2 H.1.2 I.3.6)&mdash Interaction styles (e. g. commands menus forms direct manipulation) I.3.6 [Computer graphics]: Methodology and Techniques&mdash graphics data structures and data types

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：