SMI 2012: Full A runtime cache for interactive procedural modeling

Authors:
Tim Reiner;Sylvain Lefebvre;Lorenz Diener;Ismael GarcíA;Bruno Jobard;Carsten Dachsbacher
Affiliations:
Computer Graphics Group, Karlsruhe Institute of Technology, Germany;ALICE Team, INRIA Nancy Grand-Est, France;Computer Graphics Group, Karlsruhe Institute of Technology, Germany;Geometry and Graphics Group, Universitat de Girona, Spain;ALICE Team, INRIA Nancy Grand-Est, France;Computer Graphics Group, Karlsruhe Institute of Technology, Germany
Venue:
Computers and Graphics
Year:
2012

Citing 11
Cited 1

Adaptively sampled distance fields: a general representation of shape for computer graphics

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Texturing and Modeling: A Procedural Approach

Texturing and Modeling: A Procedural Approach
Generalized Distance Functions

SMI '99 Proceedings of the International Conference on Shape Modeling and Applications
Interactive Implicit Modeling with Hierarchical Spatial Caching

SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Perfect spatial hashing

ACM SIGGRAPH 2006 Papers
Real-time GPU rendering of piecewise algebraic surfaces

ACM SIGGRAPH 2006 Papers
GigaVoxels: ray-guided streaming for efficient and detailed voxel rendering

Proceedings of the 2009 symposium on Interactive 3D graphics and games
Real-time parallel hashing on the GPU

ACM SIGGRAPH Asia 2009 papers
SMI 2011: Full Paper: Interactive modeling of implicit surfaces using a direct visualization approach with signed distance functions

Computers and Graphics
Coherent parallel hashing

Proceedings of the 2011 SIGGRAPH Asia Conference
Piecewise algebraic surface patches

Computer Aided Geometric Design

Fast percentage closer soft shadows using temporal coherence

Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games

Quantified Score

Hi-index	0.00

Visualization

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.