Right-Triangulated Irregular Networks

Evans, William S.; Kirkpatrick, David G.; Townsend, Gregg M.

doi:10.1007/s00453-001-0006-x

Cited by 114 publications

(96 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Copyright UNION Agency -Science Press, Plzen, Czech Republic. the longest edge bisection scheme to simplify memory layout by using a restricted quadtree triangulation [Bao04a,Paj98a], triangle bintrees [Duc97a,Lin96a], or hierarchies of right triangles [Eva01a,Lin02a]. However, updating the mesh at each frame prevents the use of efficient rendering schemes, such as geometry caching.…”

Section: Related Workmentioning

confidence: 99%

Seamless patches for GPU-based terrain rendering

2008

View full text Add to dashboard Cite

In this paper we present a novel approach for interactive rendering of large terrain datasets which is based on subdividing the terrain into rectangular patches at different resolutions. Each patch is represented by four triangular tiles which can be at different resolutions; and four strips which are used to stitch the four tiles in a seamless manner. As a result, our scheme maintains resolution changes within patches and not across patches. At runtime, the terrain patches are used to construct a level of detail based on view-parameters. The selected level of detail only includes the layout of the patches and the resolutions at boundary edges. Since adjacent patches agree on the resolution of common edges, the resulted mesh does not include any cracks or degenerate triangles. The GPU generates the meshes of the patches by using scaled instances of cached tiles and assigning elevation for each vertex from the cached textures. Our algorithm manages to achieve quality images at high frame rates while providing seamless transition between different levels of detail. Keywords:

show abstract

Section: Related Workmentioning

confidence: 99%

Seamless patches for GPU-based terrain rendering

2008

View full text Add to dashboard Cite

show abstract

“…The CLOD methods using hierarchical data structures, such as quadtree [1]- [5], triangle binary tree [6]- [8], longest edge bisection [9], right triangle hierarchies [10], [11], texture hierarchies [12]- [15] and vertex hierarchies [16] are usually executed by the CPU. These methods simplify the geometry efficiently by using CLOD and VFC (View Frustum Culling).…”

Section: Introductionmentioning

confidence: 99%

Geometry Splitting: An Acceleration Technique of Quadtree-Based Terrain Rendering Using GPU

Lee

Shin

2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYIn terrain visualization, the quadtree is the most frequently used data structure for progressive mesh generation. The quadtree provides an efficient level of detail selection and view frustum culling. However, most applications using quadtrees are performed on the CPU, because the pointer and recursive operation in hierarchical data structure cannot be manipulated in a programmable rendering pipeline. We present a quadtreebased terrain rendering method for GPU (Graphics Processing Unit) execution that uses vertex splitting and triangle splitting. Vertex splitting supports a level of detail selection, and triangle splitting is used for crack removal. This method offers higher performance than previous CPU-based quadtree methods, without loss of image quality. We can then use the CPU for other computations while rendering the terrain using only the GPU.

show abstract

“…Multi-resolution terrain models have been proposed in the literature that work on data regularly distributed on a grid [10,13,18,25,26,35]. Such models are based on a nested subdivision that starts from a simple regular tiling of the terrain domain into regular triangles and is generated through a refinement process defined by the uniform subdivision of a triangle into scaled copies of it.…”

Section: Out-of-core Representation Of Regular Multi-resolution Modelsmentioning

confidence: 99%

“…Each node in a triangle bintree represents a triangle t generated in the recursive subdivision, while the children of node t describe the two triangles arising from the subdivision of t (see Figure 2.2 (b)). If vertices are available at all nodes of the supporting regular grid, then a triangle bintree consists of two full trees, which can be represented implicitly as two arrays [10,13]. On the contrary, if data are available at different resolutions over different parts of the domain, then the binary forest of triangles is not complete, and dependencies must be represented explicitly, thus resulting in a more verbose data structure [18].…”

Section: Out-of-core Representation Of Regular Multi-resolution Modelsmentioning

confidence: 99%

“…This can be achieved through the application of neighbor finding techniques to the hierarchy. In [13], an algorithm for neighbor finding is proposed, which works in worst-case constant time. An alternative approach consists of using an error saturation technique, which through manipulation of the errors associated with the triangles in the hierarchy, allows for extracting conforming meshes (but not with a minimal number of triangles) without the need for neighbor finding [34].…”

Section: Out-of-core Representation Of Regular Multi-resolution Modelsmentioning

confidence: 99%

See 1 more Smart Citation

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

Right-Triangulated Irregular Networks

Cited by 114 publications

References 14 publications

Seamless patches for GPU-based terrain rendering

Seamless patches for GPU-based terrain rendering

Geometry Splitting: An Acceleration Technique of Quadtree-Based Terrain Rendering Using GPU

Out-of-core Multiresolution Terrain Modeling

Contact Info

Product

Resources

About