XFastMesh: fast view-dependent meshing from external memory

DeCoro,; Pajarola,

doi:10.1109/visual.2002.1183796

Cited by 31 publications

(23 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To handle large data sets that do not fit in local memory, external memory view-dependent rendering algorithms were developed [12,13]. In addition, a simplification method that represents geometric details using bump maps was developed by Cohen et al [14] such that it used displacement mapping for NURB surfaces.…”

Section: Related Workmentioning

confidence: 99%

Displacement patches for view-dependent rendering

2011

View full text Add to dashboard Cite

In this paper we present a new approach for interactive view-dependent rendering of large polygonal data sets which relies on advanced features of modern graphics hardware. Our preprocessing algorithm starts by generating a simplified representation of the input mesh. It then builds a multiresolution hierarchy for the simplified model. For each face in the hierarchy, it generates and assigns a displacement map that resembles the original surface represented by that face. At runtime, the multiresolution hierarchy is used to select a coarse view-dependent level-of-detail representation, which is sent to the graphics hardware. The GPU then refines the coarse representation by replacing each face with a planar tile, which is elevated according to the assigned displacement map. Our results show that our implementation achieves quality images at high frame rates.

show abstract

Section: Related Workmentioning

confidence: 99%

Displacement patches for view-dependent rendering

2011

View full text Add to dashboard Cite

show abstract

“…free form atomic clusters of C.M. DeCoro and Pajarola [7] clustering dep. free form atomic binary forest Danovaro et al [6] clustering dep.…”

Section: Discussionmentioning

confidence: 99%

“…This forest is obtained from the forest of binary vertices by replacing the subtree formed by vertices v 1 , v 2 and by their parent, which will be again v 1 for a half-edge collapse with a pointer to the corresponding half-edge e in the data structure describing the currently extracted mesh. In [7], DeCoro and Pajarola propose an out-of-core representation of the same model, to support viewdependent rendering of large 3D meshes. The proposed technique starts from the binary forest and computes almost balanced subtrees, that can fit in a disk page.…”

Section: Methods Based On Clustering Of Atomic Updatesmentioning

confidence: 99%

Out-of-core Multiresolution Terrain Modeling

Danovaro

Floriani

Puppo

et al.

Spatial Data on the Web

View full text Add to dashboard Cite

In this chapter we discuss issues about Level Of Detail (LOD) representations for digital terrain models and, especially, we describe how to deal with very large terrain datasets through out-of-core techniques that explicitly manage I/O operations between levels of memory. LOD modeling in the related context of geographical maps is discussed in Chapters 3 and 4.A dataset describing a terrain consists of a set of elevation measurements taken at a finite number of locations over a planar or a spherical domain. In a digital terrain model, elevation is extended to the whole domain of interest by averaging or interpolating the available measurements. Of course, the resulting model is affected by some approximation error and, in general, the higher the density of the samples, the smaller the error. The same arguments can be used for more general two-dimensional scalar, or vector fields (e.g., generated by simulation), defined over a manifold domain, and measured through some sampling process.Available terrain datasets are becoming larger and larger, and processing them at their full resolution often exhibits prohibitive computational costs, even for highend workstations. Simplification algorithms and multi-resolution models proposed in the literature may improve efficiency, by adapting resolution on-the-fly, according to the needs of a specific application [32]. Data at high resolution are preprocessed once in order to build a multi-resolution model, which can be queried on-line by the application. The multi-resolution model acts as a black box that provides simplified representations, where resolution is focused on the region of interest, and at the level of detail required by the application. A simplified representation is generally affected by some approximation error, which is usually associated with either the vertices, or the cells of the simplified mesh.Since current datasets often exceed the size of main memory, I/O operations between levels of memory are often the bottleneck in computation. A disk access is

show abstract

“…RUSTIC [21] and CABTT [13] are extensions of the ROAM [6] algorithm, in which subtrees of the ROAM bintree are cached and reused during rendering. A similar technique is also presented in [5] for generic meshes. BDAM [1] constructs a forest of hierarchies of right triangles, in which each node is a general triangulation of a small surface region.…”

Section: Related Workmentioning

confidence: 99%

Batched Multi Triangulation

Cignoni

Ganovelli

Gobbetti

et al.

IEEE Visualization 2005 - (VIS'05)

View full text Add to dashboard Cite

The Multi Triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolution in a Directed Acyclic Graph (DAG) which encodes the dependencies between fragments, thereby encompassing a wide class of multiresolution approaches that use hierarchies or DAGs with predefined topology. On current architectures, the classic MT is however unfit for real-time rendering, since DAG traversal costs vastly dominate raw rendering costs. In this paper, we redesign the MT framework in a GPU friendly fashion, moving its granularity from triangles to precomputed optimized triangle patches. The patches can be conveniently tri-stripped and stored in secondary memory to be loaded on demand, ready to be sent to the GPU using preferential paths. In this manner, central memory only contains the DAG structure and CPU workload becomes negligible. The major contributions of this work are: a new out-of-core multiresolution framework, that, just like the MT, encompasses a wide class of multiresolution structures; a robust and elegant way to build a well conditioned MT DAG by introducing the concept of V -partitions, that can encompass various state of the art multiresolution algorithms; an efficient multithreaded rendering engine and a general subsystem for the external memory processing and simplification of huge meshes.

show abstract

XFastMesh: fast view-dependent meshing from external memory

Cited by 31 publications

References 23 publications

Displacement patches for view-dependent rendering

Displacement patches for view-dependent rendering

Out-of-core Multiresolution Terrain Modeling

Batched Multi Triangulation

Contact Info

Product

Resources

About