Geometry Textures and Applications<sup>†</sup>

Toledo, Rodrigo; Wang, Bin; Lévy, Bruno

doi:10.1111/j.1467-8659.2008.01185.x

Cited by 12 publications

(16 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Techniques to hide seams by blending techniques. Images from [66], [55] and [21]. [39], [38], [53] and [54].…”

Section: P U B L I C At I O N Smentioning

confidence: 99%

“…Losasso and Hoppe [55] used textures as a height field and blended heights between mip-map levels. In a similar approach, presented by De Toledo et al [21], neighboring charts must share boundaries with each other, resulting in some overlapping between them. The overlapping area is necessary to avoid cracks in rendering time, and depth information is correctly generated to achieve a seamless reconstruction.…”

Section: Texture Spacementioning

confidence: 99%

“…Their method work in a similar way to the atlas transition functions defined by Grimm and Hughes [33], but they differ in that they are defined in the surrounding area outside the charts. [66], [55] and [21].…”

Section: Texture Spacementioning

confidence: 99%

“…Up to now, general objects have been taken into account only over simple continuous parameterizations [15] or by solving only for the silhouettes [62], but the problem of using Relief Mapping in combination with a multi-chart parameterization remains unsolved. The work done in [20] is the closest to this applica- tion of Continuity Mapping, where continuity between patches is solved by extending and overlapping them, solving visibility by depth-fight with the same color and depth. But, as mentioned there, this can cause serious problems for grazing viewing angles, shadows and filtering operations on the object surface.…”

Section: Continuous Simulationsmentioning

confidence: 99%

See 3 more Smart Citations

Continuity and Interpolation Techniques for Computer Graphics

González

Patow

2015

Computer Graphics Forum

View full text Add to dashboard Cite

Continuity and interpolation have been crucial topics for computer graphics since its very beginnings. Every time we want to interpolate values across some area, we need to take a set of samples over that interpolating region. However, interpolating samples faithfully allowing the results to closely match the underlying functions can be a tricky task as the functions to sample could not be smooth and, in the worst case, it could be even impossible when they are not continuous. In those situations bringing the required continuity is not an easy task, and much work has been done to solve this problem. In this paper, we focus on the state of the art in continuity and interpolation in three stages of the real‐time rendering pipeline. We study these problems and their current solutions in texture space (2D), object space (3D) and screen space. With this review of the literature in these areas, we hope to bring new light and foster research in these fundamental, yet not completely solved problems in computer graphics.

show abstract

“…Techniques to hide seams by blending techniques. Images from [66], [55] and [21]. [39], [38], [53] and [54].…”

Section: P U B L I C At I O N Smentioning

confidence: 99%

Section: Texture Spacementioning

confidence: 99%

Section: Texture Spacementioning

confidence: 99%

Section: Continuous Simulationsmentioning

confidence: 99%

See 2 more Smart Citations

Continuity and Interpolation Techniques for Computer Graphics

González

Patow

2015

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…We therefore empirically combine them to achieve the best combination of visual appearance and frame rate. For crown visualization of distant trees, on the other hand, we propose a pixel‐space procedural modelling method [DTWL08] based on volumetric adaptation of texture bombing [WSCP13]. This significantly reduces the amount of necessary geometry and enables interactive display of vast forest areas.…”

Section: Introductionmentioning

confidence: 99%

Interactive Large‐Scale Procedural Forest Construction and Visualization Based on Particle Flow Simulation

Kohek

Strnad

2017

Computer Graphics Forum

View full text Add to dashboard Cite

Interactive visualization of large forest scenes is challenging due to the large amount of geometric detail that needs to be generated and stored, particularly in scenarios with a moving observer such as forest walkthroughs or overflights. Here, we present a new method for large‐scale procedural forest generation and visualization at interactive rates. We propose a hybrid approach by combining geometry‐based and volumetric modelling techniques with gradually transitioning level of detail (LOD). Nearer trees are constructed using an extended particle flow algorithm, in which particle trails outline the tree ramification in an inverse direction, i.e. from the leaves towards the roots. Reduced geometric representation of a tree is obtained by subsampling the trails. For distant trees, a new volumetric rendering technique in pixel‐space is introduced, which avoids geometry formation altogether and enables visualization of vast forest areas with millions of unique trees. We demonstrate that a GPU‐based implementation of the proposed method provides interactive frame rates in forest overflight scenarios, where new trees are constructed and their LOD adjusted on the fly.

show abstract