Random Fields on Rank-1 Lattices

  • The simulation of random fields has many applications in computer graphics such as e.g. ocean wave or turbulent wind field modeling. We present a new and strikingly simple synthesis algorithm for random fields on rank-1 lattices that requires only one Fourier transform independent of the dimension of the support of the random field. The underlying mathematical principle of discrete Fourier transforms on rank-1 lattices breaks the curse of dimension of the standard tensor product Fourier transform, i.e. the number of function values does not exponentially depend on the dimension, but can be chosen linearly.

Download full text files

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:Alexander Keller
URN:urn:nbn:de:hbz:386-kluedo-49691
Series (Serial Number):Interner Bericht des Fachbereich Informatik (307)
Document Type:Report
Language of publication:English
Date of Publication (online):2017/10/26
Year of first Publication:2001
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2017/10/26
Page Number:6
Faculties / Organisational entities:Kaiserslautern - Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Licence (German):Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0)