Efficient visualization of lagrangian coherent structures by filtered AMR ridge extraction

This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during ridge extraction. This requirement is met by the concept of Lagrangian coherent structures which is based on trajectori...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 13(2007), 6 vom: 01. Nov., Seite 1456-63
1. Verfasser: Sadlo, Filip (VerfasserIn)
Weitere Verfasser: Peikert, Ronald
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 NLM174687435
003 DE-627
005 20231223140454.0
007 tu
008 231223s2007 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0582.xml 
035 |a (DE-627)NLM174687435 
035 |a (NLM)17968097 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Sadlo, Filip  |e verfasserin  |4 aut 
245 1 0 |a Efficient visualization of lagrangian coherent structures by filtered AMR ridge extraction 
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 14.12.2007 
500 |a Date Revised 30.10.2007 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during ridge extraction. This requirement is met by the concept of Lagrangian coherent structures which is based on trajectories started at arbitrary sampling grids that are independent of the underlying vector field. The Lagrangian coherent structures are extracted as ridges in finite Lyapunov exponent fields computed from these grids of trajectories. The method is applied to several variants of finite Lyapunov exponents, one of which is newly introduced. High computation time due to the high number of required trajectories is a main drawback when computing Lyapunov exponents of 3-dimensional vector fields. The presented method allows a substantial speed-up by avoiding the seeding of trajectories in regions where no ridges are present or do not satisfy the prescribed filter criteria such as a minimum finite Lyapunov exponent 
650 4 |a Journal Article 
700 1 |a Peikert, Ronald  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 13(2007), 6 vom: 01. Nov., Seite 1456-63  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:13  |g year:2007  |g number:6  |g day:01  |g month:11  |g pages:1456-63 
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 6  |b 01  |c 11  |h 1456-63