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

Adaptive TetraPuzzles: Efficient out-of-core construction and visualization of gigantic multiresolution polygonal models

引用

ACM TRANSACTIONS ON GRAPHICS 2004年第3期23卷 796-803页

作者： Cignoni, P Ganovelli, F Gobbetti, E Marton, F Ponchio, F Scopigno, R CNR ISTI I-56124 Pisa Italy CRS4 I-09010 Pula Italy

We describe an efficient technique for out-of-core construction and accurate view-dependent visualization of very large surface models. The method uses a regular conformal hierarchy of tetrahedra to spatially partition the model. Each tetrahedral cell contains a precomputed simplified version of the original model, represented using cache coherent indexed strips for fast rendering. The representation is constructed during a fine-to-coarse simplification of the surface contained in diamonds (sets of tetrahedral cells sharing their longest edge). The construction preprocess operates out-of-core and parallelizes nicely. Appropriate boundary constraints are introduced in the simplification to ensure that all conforming selective subdivisions of the tetrahedron hierarchy lead to correctly matching surface patches. For each frame at runtime, the hierarchy is traversed coarse-to-fine to select diamonds of the appropriate resolution given the view parameters. The resulting system can interatively render high quality Views Of out-of-core models of hundreds of millions of triangles at over 40Hz (or 70M triangles/s) on current commodity graphics platforms.

关键词： out-of-core algorithms level of detail

来源：评论

学校读者我要写书评

暂无评论

Adaptive 4-8 texture hierarchies 04

Adaptive 4-8 texture hierarchies

引用

IEEE Visualization 2004 Conference

作者： Hwa, LM Duchaineau, MA Joy, KI Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)0780387880

We address the texture level-of-detail problem for extremely large surfaces such as terrain during realtime, view-dependent rendering. A novel texture hierarchy is introduced based on 4-8 refinement of raster tiles. in which the texture grids in effect rotate 45 degrees for each level of refinement. This hierarchy provides twice as many levels of detail as conventional quadtree-style refinement schemes such as mipmaps, and thus provides per-pixel view-dependent filtering that is twice as close to the ideal cutoff frequency for an average pixel. Because of this more gradual change in low-pass filtering, and due to the m:)re precise emulation of the ideal cutoff frequency, we find in practice that the transitions between texture levels of detail are not perceptible. This allows rendering systems to avoid the complexity and performance costs of per-pixel blending between texture levels of detail. The 4-8 texturing scheme is integrated into a variant of the Real-time Optimally Adapting Meshes (ROAM) algorithm for view-dependent multiresolution mesh generation. Improvements to ROAM included here are: the diamond data structure as a streamlined replacement for the triangle bintree elements, the use of lowpass-filtered geometry patches in place of individual triangles, integration of 4-8 textures, and a simple out-of-core data access mechanism for texture and geometry tiles.

关键词： large data set visualization level-of-detail techniques view-dependent visualization adaptive textures out-of-core algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive tetrapuzzles: efficient out-of-core construction and visualization of gigantic multiresolution polygonal models 04

Adaptive tetrapuzzles: efficient out-of-core construction an...

引用

ACM SIGGRAPH 2004 Papers

作者： Paolo Cignoni Fabio Ganovelli Enrico Gobbetti Fabio Marton Federico Ponchio Roberto Scopigno ISTI - CNR CRS4

ISBN: (纸本)9781450378239

We describe an efficient technique for out-of-core construction and accurate view-dependent visualization of very large surface models. The method uses a regular conformal hierarchy of tetrahedra to spatially partition the model. Each tetrahedral cell contains a precomputed simplified version of the original model, represented using cache coherent indexed strips for fast rendering. The representation is constructed during a fine-to-coarse simplification of the surface contained in diamonds (sets of tetrahedral cells sharing their longest edge). The construction preprocess operates out-of-core and parallelizes nicely. Appropriate boundary constraints are introduced in the simplification to ensure that all conforming selective subdivisions of the tetrahedron hierarchy lead to correctly matching surface patches. For each frame at runtime, the hierarchy is traversed coarse-to-fine to select diamonds of the appropriate resolution given the view parameters. The resulting system can interatively render high quality views of out-of-core models of hundreds of millions of triangles at over 40Hz (or 70M triangles/s) on current commodity graphics platforms.

关键词： Level of Detail out-of-core algorithms

来源：评论

学校读者我要写书评

暂无评论

out-of-core compression for gigantic polygon meshes 03

Out-of-core compression for gigantic polygon meshes

引用

Annual Symposium of the ACM SIGGRAPH

作者： Isenburg, M Gumhold, S Univ N Carolina Chapel Hill NC 27514 USA Univ Tubingen WSIGRIS D-72074 Tubingen Germany

ISBN: (纸本)9781581137095

Polygonal models acquired with emerging 3D scanning technology or from large scale CAD applications easily reach sizes of several gigabytes and do not fit in the address space of common 32-bit desktop PCs. In this paper we propose an out-of-core mesh compression technique that converts such gigantic meshes into a streamable, highly compressed representation. During decompression only a small portion of the mesh needs to be kept in memory at any time. As full connectivity information is available along the decompression boundaries, this provides seamless mesh access for incremental in-core processing on gigantic meshes. Decompression speeds are CPU-limited and exceed one million vertices and two million triangles per second on a 1.8 GHz Athlon processor. A novel external memory data structure provides our compression engine with transparent access to arbitrary large meshes. This out-of-core mesh was designed to accommodate the access pattern of our region-growing based compressor, which - in return - performs mesh queries as seldom and as local as possible by remembering previous queries as long as needed and by adapting its traversal slightly. The achieved compression rates are state-of-the-art.

关键词： external memory data structures mesh compression out-of-core algorithms streaming meshes processing sequences

来源：评论

学校读者我要写书评

暂无评论

External memory management and simplification of huge meshes

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2003年第4期9卷 525-537页

作者： Cignoni, P Montani, C Rocchini, C Scopigno, R CNR Ist Sci & Tecnol Informaz Area Ric I-56124 Pisa Italy

Very large triangle meshes, i.e., meshes composed of millions of faces, are becoming common in many applications. Obviously, processing, rendering, transmission, and archiving of these meshes are not simple tasks. Mesh simplification and LOD management are a rather mature technology that, in many cases, can efficiently manage complex data. But, only a few available systems can manage meshes characterized by a huge size: RAM size is often a severe bottleneck. In this paper, we present a data structure called Octree-based External Memory Mesh (OEMM). It supports external memory management of complex meshes, loading dynamically in main memory only the selected sections and preserving data consistency during local updates. The functionalities implemented on this data structure (simplification, detail preservation, mesh editing, visualization, and inspection) can be applied to huge triangles meshes on low-cost PC platforms. The time overhead due to the external memory management is affordable. Results of the test of our system on complex meshes are presented.

关键词： out-of-core algorithms hierarchical data structures mesh simplification level of detail 3D scanning texture synthesis

来源：评论

学校读者我要写书评

暂无评论

Large mesh simplification using processing sequences 03

Large mesh simplification using processing sequences

引用

IEEE Visualization 2003 Conference

作者： Isenburg, M Lindstrom, P Gumhold, S Snoeyink, J Univ N Carolina Chapel Hill NC 27514 USA

ISBN: (纸本)0780381203

In this paper we show how out-of-core mesh processing techniques can be adapted to pet-form their computations based on the new processing sequence paradigm [Isenburg and Gumhold 2003;Isenburg et al. 2003], using mesh simplification as an example. We believe that this processing concept will also prove useful for other tasks, such as parameterization, remeshing, or smoothing, for which currently only in-core solutions exist. A processing sequence represents a mesh as a particular interleaved ordering of indexed triangles and vertices. This representation allows streaming very large meshes through main memory while maintaining information about the visitation status of edges and vertices. At any time, only a small portion of the mesh is kept in-core, with the bulk of the mesh data residing on disk. Mesh access is restricted to a fixed traversal order, but full connectivity and geometry information is available for the active elements of the traversal. This provides seamless and highly efficient out-of-core access to very large meshes for algorithms that can adapt their computations to this fixed ordering. The two abstractions that are naturally supported by this representation are boundary-based and buffer-based processing. We illustrate both abstractions by adapting two different simplification methods to perform their computation using a prototype of our mesh processing sequence API. Both algorithms benefit from using processing sequences in terms of improved quality, more efficient execution, and smaller memory footprints.

关键词： out-of-core algorithms processing sequences mesh simplification large meshes

来源：评论

学校读者我要写书评

暂无评论

out-of-core compression for gigantic polygon meshes

引用

ACM TRANSACTIONS ON GRAPHICS 2003年第3期22卷 935-942页

作者： Isenburg, M Gumhold, S Univ N Carolina Chapel Hill NC 27514 USA Univ Tubingen WSIGRIS D-72074 Tubingen Germany

关键词： external memory data structures mesh compression out-of-core algorithms streaming meshes processing sequences

来源：评论

学校读者我要写书评

暂无评论

out-of-core construction and visualization of multiresolution surfaces 03

Out-of-core construction and visualization of multiresolutio...

引用

Proceedings of the 2003 symposium on Interactive 3D graphics

作者： Peter Lindstrom Lawrence Livermore National Laboratory

ISBN: (纸本)9781581136456

We present a method for end-to-end out-of-core simplification and view-dependent visualization of large surfaces. The method consists of three phases: (1) memory insensitive simplification; (2) memory insensitive construction of a multiresolution hierarchy; and (3) run-time, output-sensitive, view-dependent rendering and navigation of the mesh. The first two off-line phases are performed entirely on disk, and use only a small, constant amount of memory, whereas the run-time system pages in only the rendered parts of the mesh in a cache coherent manner. As a result, we are able to process and visualize arbitrarily large meshes given a sufficient amount of disk space; a constant multiple of the size of the input *** to recent work on out-of-core simplification, our memory insensitive method uses vertex clustering on a rectilinear octree grid to coarsen and create a hierarchy for the mesh, and a quadric error metric to choose vertex positions at all levels of resolution. We show how the quadric information can be used to concisely represent vertex position, surface normal, error, and curvature information for anisotropic view-dependent coarsening and silhouette *** run-time component of our system uses asynchronous rendering and view-dependent refinement driven by screen-space error and visibility. The system exploits frame-to-frame coherence and has been designed to allow preemptive refinement at the granularity of individual vertices to support refinement on a time *** results indicate a significant improvement in processing speed over previous methods for out-of-core multiresolution surface construction. Meanwhile, all phases of the method are disk and memory efficient, and are fairly straightforward to implement.

关键词： view-dependent refinement surface simplification out-of-core algorithms large-data visualization

来源：评论

学校读者我要写书评

暂无评论

Terrain simplification simplified: A general framework for view-dependent out-of-core visualization

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2002年第3期8卷 239-254页

作者： Lindstrom, P Pascucci, V Lawrence Livermore Natl Lab Livermore CA 94551 USA

This paper describes a general framework for out-of-core rendering and management of massive terrain surfaces. The two key components of this framework are: view-dependent refinement of the terrain mesh and a simple scheme for organizing the terrain data to improve coherence and reduce the number of paging events from external storage to main memory. Similar to several previously proposed methods for view-dependent refinement, we recursively subdivide a triangle mesh defined over regularly gridded data using longest-edge bisection. As part of this single, per-frame refinement pass, we perform triangle stripping, view frustum culling, and smooth blending of geometry using geomorphing. Meanwhile, our refinement framework supports a large class of error metrics, is highly competitive in terms of rendering performance, and is surprisingly simple to implement. Independent of our refinement algorithm, we also describe several data layout techniques for providing coherent access to the terrain data. By reordering the data in a manner that is more consistent with our recursive access pattern, we show that visualization of gigabyte-size data sets can be realized even on low-end, commodity PCs without the need for complicated and explicit data paging techniques. Rather, by virtue of dramatic improvements in multilevel cache coherence, we rely on the built-in paging mechanisms of the operating system to perform this task. The end result is a straightforward, simple-to-implement, pointerless indexing scheme that dramatically improves the data locality and paging performance over conventional matrix-based layouts.

关键词： terrain visualization surface simplification view-dependent refinement continuous levels of detail edge bisection error metrics geomorphing out-of-core algorithms external memory paging data layouts

来源：评论

学校读者我要写书评

暂无评论

Terrain simplification simplified: A general framework for view-dependent out-of-core visualization

Terrain simplification simplified: A general framework for v...

引用

7th IEEE Symposium on Information Visualization (INFOVIS 2001)

作者： Lindstrom, P Pascucci, V Lawrence Livermore Natl Lab Livermore CA 94551 USA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：