Item


A runtime cache for interactive procedural modeling

We present an efficient runtime cache to accelerate the display of procedurally displaced and textured implicit surfaces, exploiting spatio-temporal coherence between consecutive frames. We cache evaluations of implicit textures covering a conceptually infinite space. Rotating objects, zooming onto surfaces, and locally deforming shapes now requires minor cache updates per frame and benefits from mostly cached values, avoiding expensive re-evaluations. A novel parallel hashing scheme supports arbitrarily large data records and allows for an automated deletion policy: new information may evict information no longer required from the cache, resulting in an efficient usage. This sets our solution apart from previous caching techniques, which do not dynamically adapt to view changes and interactive shape modifications. We provide a thorough analysis on cache behavior for different procedural noise functions to displace implicit base shapes, during typical modeling operations

This work was partially funded by the Agence Nationale de la Recherche (SIMILAR-CITIES 2008-COORD-021-01) and an INRIA Nancy Grand-Est collaboration grant. Tim Reiner is supported by the Intel Visual Computing Institute, Saarbrücken. Ismael García is supported by the Ministerio de Ciencia e Innovación, Spain (TIN2010-20590-C02-02)

© Computers and Graphics, vol. 36, núm. 5, p. 366-375

Elsevier

Author: Reiner, Tim
Lefebvre, Sylvain
Diener, Lorenz
García Fernández, Ismael
Jobard, Bruno
Dachsbacher, Carsten
Date: 2012 August
Abstract: We present an efficient runtime cache to accelerate the display of procedurally displaced and textured implicit surfaces, exploiting spatio-temporal coherence between consecutive frames. We cache evaluations of implicit textures covering a conceptually infinite space. Rotating objects, zooming onto surfaces, and locally deforming shapes now requires minor cache updates per frame and benefits from mostly cached values, avoiding expensive re-evaluations. A novel parallel hashing scheme supports arbitrarily large data records and allows for an automated deletion policy: new information may evict information no longer required from the cache, resulting in an efficient usage. This sets our solution apart from previous caching techniques, which do not dynamically adapt to view changes and interactive shape modifications. We provide a thorough analysis on cache behavior for different procedural noise functions to displace implicit base shapes, during typical modeling operations
This work was partially funded by the Agence Nationale de la Recherche (SIMILAR-CITIES 2008-COORD-021-01) and an INRIA Nancy Grand-Est collaboration grant. Tim Reiner is supported by the Intel Visual Computing Institute, Saarbrücken. Ismael García is supported by the Ministerio de Ciencia e Innovación, Spain (TIN2010-20590-C02-02)
Format: application/pdf
Citation: https://doi.org/10.1016/j.cag.2012.03.031
ISSN: 0097-8493
Document access: http://hdl.handle.net/10256/14076
Language: eng
Publisher: Elsevier
Collection: MICINN/PN 2011-2013/TIN2010-20590-C02-02
Reproducció digital del document publicat a: https://doi.org/10.1016/j.cag.2012.03.031
Articles publicats (D-IMA)
Is part of: © Computers and Graphics, vol. 36, núm. 5, p. 366-375
Rights: Tots els drets reservats
Subject: Infografia
Computer graphics
Visualització tridimensional (Informàtica)
Three-dimensional display systems
Title: A runtime cache for interactive procedural modeling
Type: info:eu-repo/semantics/article
Repository: DUGiDocs

Subjects

Authors