EG2022

Permanent URI for this community

https://diglib.eg.org/handle/10.2312/2633163

Browse

Browsing EG2022 by Author "Bán, Róbert"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Hermite Interpolation of Heightmaps
    (The Eurographics Association, 2022) Bán, Róbert; Valasek, Gábor; Sauvage, Basile; Hasic-Telalovic, Jasminka
    Heightmaps are ubiquitous in real-time computer graphics. They are used to describe geometric detail over an underlying coarser surface. Various techniques, such as parallax occlusion mapping and relief mapping, use heightmap textures to impose mesostructural details over macrostructural elements without increasing the actual complexity of the rendered geometries. We aim to improve the quality of the fine resolution surface by incorporating the gradient of the original function into the sampling procedure. The traditional representation consists of simple height values stored on a regular grid. During rendering, bilinear filtering is applied. We propose to store the partial derivatives with the height values and use Hermite interpolation between the samples. This guarantees a globally C1 continuous heightfield instead of the C0 -continuity of bilinear filtering. Moreover, incorporating higher order information via partial derivatives allows us to use lower resolution heightmaps while retaining the appearance of a higher resolution map. In parallax mapping, surface normals are often stored alongside the height values, as such, our method does not require additional storage, since normals and partial derivatives can be calculated from one another. The exact normals of the reconstructed cubic Hermite surface can also be calculated, resulting in a storage efficient replacement for normal mapping with richer visual appearance.
  • Thumbnail Image
    Item
    Quick Cone Map Generation on the GPU
    (The Eurographics Association, 2022) Valasek, Gábor; Bán, Róbert; Pelechano, Nuria; Vanderhaeghe, David
    We propose an efficient conservative cone map generation algorithm that has T(N^2 logN) complexity for textures of dimension N ×N in contrast to the T(N^4) complexity of brute-force approaches. This is achieved by using a maximum mip texture of a heightmap to process all texels during the search for cone apertures, resulting in real-time generation times. Furthermore, we show that discarding already visited regions of neighboring mip texels widens the obtained cones considerably while still being conservative. Finally, we present a method to increase cone aperture tangents further at the expense of conservativeness. We compare our methods to brute-force and relaxed cone maps in generation and rendering performance.