Fast animation of lightning using an adaptive mesh

We present a fast method for simulating, animating, and rendering lightning using adaptive grids. The "dielectric breakdown model" is an elegant algorithm for electrical pattern formation that we extend to enable animation of lightning. The simulation can be slow, particularly in 3D, becau...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 13(2007), 2 vom: 13. März, Seite 390-402
1. Verfasser: Kim, Theodore (VerfasserIn)
Weitere Verfasser: Lin, Ming C
Format: Aufsatz
Sprache:English
Veröffentlicht: 2007
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM167657186
003 DE-627
005 20231223113426.0
007 tu
008 231223s2007 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0559.xml 
035 |a (DE-627)NLM167657186 
035 |a (NLM)17218754 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Kim, Theodore  |e verfasserin  |4 aut 
245 1 0 |a Fast animation of lightning using an adaptive mesh 
264 1 |c 2007 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 27.03.2007 
500 |a Date Revised 12.01.2007 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a We present a fast method for simulating, animating, and rendering lightning using adaptive grids. The "dielectric breakdown model" is an elegant algorithm for electrical pattern formation that we extend to enable animation of lightning. The simulation can be slow, particularly in 3D, because it involves solving a large Poisson problem. Losasso et al. recently proposed an octree data structure for simulating water and smoke, and we show that this discretization can be applied to the problem of lightning simulation as well. However, implementing the incomplete Cholesky conjugate gradient (ICCG) solver for this problem can be daunting, so we provide an extensive discussion of implementation issues. ICCG solvers can usually be accelerated using "Eisenstat's trick," but the trick cannot be directly applied to the adaptive case. Fortunately, we show that an "almost incomplete Cholesky" factorization can be computed so that Eisenstat's trick can still be used. We then present a fast rendering method based on convolution that is competitive with Monte Carlo ray tracing but orders of magnitude faster, and we also show how to further improve the visual results using jittering 
650 4 |a Journal Article 
700 1 |a Lin, Ming C  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 13(2007), 2 vom: 13. März, Seite 390-402  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:13  |g year:2007  |g number:2  |g day:13  |g month:03  |g pages:390-402 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 13  |j 2007  |e 2  |b 13  |c 03  |h 390-402