Loading…
Measuring Complexity in Lagrangian and Eulerian Flow Descriptions
Automatic detection of relevant structures in scientific data sets is still one of the big challenges in visualization. Techniques based on information theory have shown to be a promising direction to automatically highlight interesting subsets of a time‐dependent data set. The methods that have bee...
Saved in:
Published in: | Computer graphics forum 2010-09, Vol.29 (6), p.1783-1794 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c4118-43ac9253cafe89f71eee7eae5a2a684f83613cb8a5472d22b48225b580fcd9de3 |
---|---|
cites | cdi_FETCH-LOGICAL-c4118-43ac9253cafe89f71eee7eae5a2a684f83613cb8a5472d22b48225b580fcd9de3 |
container_end_page | 1794 |
container_issue | 6 |
container_start_page | 1783 |
container_title | Computer graphics forum |
container_volume | 29 |
creator | Jänicke, H. Scheuermann, G. |
description | Automatic detection of relevant structures in scientific data sets is still one of the big challenges in visualization. Techniques based on information theory have shown to be a promising direction to automatically highlight interesting subsets of a time‐dependent data set. The methods that have been proposed so far, however, were restricted to the Eulerian view. In the Eulerian description of motion, a position fixed in space is observed over time. In fluid dynamics, however, not only the site‐specific analysis of the flow is of interest, but also the temporal evolution of particles that are advected through the domain by the flow. This second description of motion is called the Lagrangian perspective. To support these two different frames of reference widely used in CFD research, we extend the notion of local statistical complexity (LSC) to make them applicable to Lagrangian and Eulerian flow descriptions. Thus, coherent structures can be identified by highlighting positions that either feature unusual temporal dynamics at a fixed position or that hold a particle that experiences such dynamics while passing through the position. A new area of application is opened by LagrangianLSC, which can be applied to short pathlines running through each position in the data set, as well as to individual pathlines computed for longer time intervals. Coloring the pathline according to the local complexity helps to detect extraordinary dynamics while the particle passes through the domain. The two techniques are explained and compared using different fluid flow examples. |
doi_str_mv | 10.1111/j.1467-8659.2010.01648.x |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671438061</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1671438061</sourcerecordid><originalsourceid>FETCH-LOGICAL-c4118-43ac9253cafe89f71eee7eae5a2a684f83613cb8a5472d22b48225b580fcd9de3</originalsourceid><addsrcrecordid>eNqNkE1PAjEQhhujiYj-h40nL4v93JaDB4KCJvhx0Jh4mZRllhSXXWzZAP_erhgOnuylnen7TNqHkITRHovretFjMtOpyVS_x2nsUpZJ09sekc7h4ph0Ylenmip1Ss5CWFBKpc5Uhwwe0YbGu2qeDOvlqsStW-8SVyUTO_e2mjtbJbaaJXdNib4tRmW9SW4x5N6t1q6uwjk5KWwZ8OJ375K30d3r8D6dPI8fhoNJmkvGTCqFzftcidwWaPqFZoio0aKy3GZGFkZkTORTY5XUfMb5VBrO1VQZWuSz_gxFl1zt5658_dVgWMPShRzL0lZYNwHiB5kUhsYxXXL5J7qoG1_F14FWVGVKGhlDZh_KfR2CxwJW3i2t3wGj0KqFBbQGoTUIrVr4UQvbiN7s0Y0rcfdvDobjUXuKfLrnXVjj9sBb_wmZFlrB-9MYXsT9x_idKzDiG3dZjc8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>750565484</pqid></control><display><type>article</type><title>Measuring Complexity in Lagrangian and Eulerian Flow Descriptions</title><source>Access via Business Source (EBSCOhost)</source><source>Wiley-Blackwell Read & Publish Collection</source><source>Art source</source><creator>Jänicke, H. ; Scheuermann, G.</creator><creatorcontrib>Jänicke, H. ; Scheuermann, G.</creatorcontrib><description>Automatic detection of relevant structures in scientific data sets is still one of the big challenges in visualization. Techniques based on information theory have shown to be a promising direction to automatically highlight interesting subsets of a time‐dependent data set. The methods that have been proposed so far, however, were restricted to the Eulerian view. In the Eulerian description of motion, a position fixed in space is observed over time. In fluid dynamics, however, not only the site‐specific analysis of the flow is of interest, but also the temporal evolution of particles that are advected through the domain by the flow. This second description of motion is called the Lagrangian perspective. To support these two different frames of reference widely used in CFD research, we extend the notion of local statistical complexity (LSC) to make them applicable to Lagrangian and Eulerian flow descriptions. Thus, coherent structures can be identified by highlighting positions that either feature unusual temporal dynamics at a fixed position or that hold a particle that experiences such dynamics while passing through the position. A new area of application is opened by LagrangianLSC, which can be applied to short pathlines running through each position in the data set, as well as to individual pathlines computed for longer time intervals. Coloring the pathline according to the local complexity helps to detect extraordinary dynamics while the particle passes through the domain. The two techniques are explained and compared using different fluid flow examples.</description><identifier>ISSN: 0167-7055</identifier><identifier>EISSN: 1467-8659</identifier><identifier>DOI: 10.1111/j.1467-8659.2010.01648.x</identifier><language>eng</language><publisher>Oxford, UK: Blackwell Publishing Ltd</publisher><subject>Complexity ; Complexity theory ; Computational fluid dynamics ; Computer graphics ; Datasets ; Descriptions ; Dynamics ; flow visualization ; Fluid dynamics ; Fluid flow ; frame of reference ; I.6.6 [Simulation and Modeling]: Simulation Output Analysis ; Information theory ; Intervals ; J.2 [Physical Sciences and Engineering]: Mathematics and Statistics ; Lagrange multiplier ; statistical complexity ; Studies ; Temporal logic ; time-dependent data ; Visualization</subject><ispartof>Computer graphics forum, 2010-09, Vol.29 (6), p.1783-1794</ispartof><rights>2010 The Authors Journal compilation © 2010 The Eurographics Association and Blackwell Publishing Ltd.</rights><rights>2010 The Eurographics Association and Blackwell Publishing</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c4118-43ac9253cafe89f71eee7eae5a2a684f83613cb8a5472d22b48225b580fcd9de3</citedby><cites>FETCH-LOGICAL-c4118-43ac9253cafe89f71eee7eae5a2a684f83613cb8a5472d22b48225b580fcd9de3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Jänicke, H.</creatorcontrib><creatorcontrib>Scheuermann, G.</creatorcontrib><title>Measuring Complexity in Lagrangian and Eulerian Flow Descriptions</title><title>Computer graphics forum</title><description>Automatic detection of relevant structures in scientific data sets is still one of the big challenges in visualization. Techniques based on information theory have shown to be a promising direction to automatically highlight interesting subsets of a time‐dependent data set. The methods that have been proposed so far, however, were restricted to the Eulerian view. In the Eulerian description of motion, a position fixed in space is observed over time. In fluid dynamics, however, not only the site‐specific analysis of the flow is of interest, but also the temporal evolution of particles that are advected through the domain by the flow. This second description of motion is called the Lagrangian perspective. To support these two different frames of reference widely used in CFD research, we extend the notion of local statistical complexity (LSC) to make them applicable to Lagrangian and Eulerian flow descriptions. Thus, coherent structures can be identified by highlighting positions that either feature unusual temporal dynamics at a fixed position or that hold a particle that experiences such dynamics while passing through the position. A new area of application is opened by LagrangianLSC, which can be applied to short pathlines running through each position in the data set, as well as to individual pathlines computed for longer time intervals. Coloring the pathline according to the local complexity helps to detect extraordinary dynamics while the particle passes through the domain. The two techniques are explained and compared using different fluid flow examples.</description><subject>Complexity</subject><subject>Complexity theory</subject><subject>Computational fluid dynamics</subject><subject>Computer graphics</subject><subject>Datasets</subject><subject>Descriptions</subject><subject>Dynamics</subject><subject>flow visualization</subject><subject>Fluid dynamics</subject><subject>Fluid flow</subject><subject>frame of reference</subject><subject>I.6.6 [Simulation and Modeling]: Simulation Output Analysis</subject><subject>Information theory</subject><subject>Intervals</subject><subject>J.2 [Physical Sciences and Engineering]: Mathematics and Statistics</subject><subject>Lagrange multiplier</subject><subject>statistical complexity</subject><subject>Studies</subject><subject>Temporal logic</subject><subject>time-dependent data</subject><subject>Visualization</subject><issn>0167-7055</issn><issn>1467-8659</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNqNkE1PAjEQhhujiYj-h40nL4v93JaDB4KCJvhx0Jh4mZRllhSXXWzZAP_erhgOnuylnen7TNqHkITRHovretFjMtOpyVS_x2nsUpZJ09sekc7h4ph0Ylenmip1Ss5CWFBKpc5Uhwwe0YbGu2qeDOvlqsStW-8SVyUTO_e2mjtbJbaaJXdNib4tRmW9SW4x5N6t1q6uwjk5KWwZ8OJ375K30d3r8D6dPI8fhoNJmkvGTCqFzftcidwWaPqFZoio0aKy3GZGFkZkTORTY5XUfMb5VBrO1VQZWuSz_gxFl1zt5658_dVgWMPShRzL0lZYNwHiB5kUhsYxXXL5J7qoG1_F14FWVGVKGhlDZh_KfR2CxwJW3i2t3wGj0KqFBbQGoTUIrVr4UQvbiN7s0Y0rcfdvDobjUXuKfLrnXVjj9sBb_wmZFlrB-9MYXsT9x_idKzDiG3dZjc8</recordid><startdate>201009</startdate><enddate>201009</enddate><creator>Jänicke, H.</creator><creator>Scheuermann, G.</creator><general>Blackwell Publishing Ltd</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>201009</creationdate><title>Measuring Complexity in Lagrangian and Eulerian Flow Descriptions</title><author>Jänicke, H. ; Scheuermann, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c4118-43ac9253cafe89f71eee7eae5a2a684f83613cb8a5472d22b48225b580fcd9de3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Complexity</topic><topic>Complexity theory</topic><topic>Computational fluid dynamics</topic><topic>Computer graphics</topic><topic>Datasets</topic><topic>Descriptions</topic><topic>Dynamics</topic><topic>flow visualization</topic><topic>Fluid dynamics</topic><topic>Fluid flow</topic><topic>frame of reference</topic><topic>I.6.6 [Simulation and Modeling]: Simulation Output Analysis</topic><topic>Information theory</topic><topic>Intervals</topic><topic>J.2 [Physical Sciences and Engineering]: Mathematics and Statistics</topic><topic>Lagrange multiplier</topic><topic>statistical complexity</topic><topic>Studies</topic><topic>Temporal logic</topic><topic>time-dependent data</topic><topic>Visualization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jänicke, H.</creatorcontrib><creatorcontrib>Scheuermann, G.</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>Computer graphics forum</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jänicke, H.</au><au>Scheuermann, G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Measuring Complexity in Lagrangian and Eulerian Flow Descriptions</atitle><jtitle>Computer graphics forum</jtitle><date>2010-09</date><risdate>2010</risdate><volume>29</volume><issue>6</issue><spage>1783</spage><epage>1794</epage><pages>1783-1794</pages><issn>0167-7055</issn><eissn>1467-8659</eissn><abstract>Automatic detection of relevant structures in scientific data sets is still one of the big challenges in visualization. Techniques based on information theory have shown to be a promising direction to automatically highlight interesting subsets of a time‐dependent data set. The methods that have been proposed so far, however, were restricted to the Eulerian view. In the Eulerian description of motion, a position fixed in space is observed over time. In fluid dynamics, however, not only the site‐specific analysis of the flow is of interest, but also the temporal evolution of particles that are advected through the domain by the flow. This second description of motion is called the Lagrangian perspective. To support these two different frames of reference widely used in CFD research, we extend the notion of local statistical complexity (LSC) to make them applicable to Lagrangian and Eulerian flow descriptions. Thus, coherent structures can be identified by highlighting positions that either feature unusual temporal dynamics at a fixed position or that hold a particle that experiences such dynamics while passing through the position. A new area of application is opened by LagrangianLSC, which can be applied to short pathlines running through each position in the data set, as well as to individual pathlines computed for longer time intervals. Coloring the pathline according to the local complexity helps to detect extraordinary dynamics while the particle passes through the domain. The two techniques are explained and compared using different fluid flow examples.</abstract><cop>Oxford, UK</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1111/j.1467-8659.2010.01648.x</doi><tpages>12</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0167-7055 |
ispartof | Computer graphics forum, 2010-09, Vol.29 (6), p.1783-1794 |
issn | 0167-7055 1467-8659 |
language | eng |
recordid | cdi_proquest_miscellaneous_1671438061 |
source | Access via Business Source (EBSCOhost); Wiley-Blackwell Read & Publish Collection; Art source |
subjects | Complexity Complexity theory Computational fluid dynamics Computer graphics Datasets Descriptions Dynamics flow visualization Fluid dynamics Fluid flow frame of reference I.6.6 [Simulation and Modeling]: Simulation Output Analysis Information theory Intervals J.2 [Physical Sciences and Engineering]: Mathematics and Statistics Lagrange multiplier statistical complexity Studies Temporal logic time-dependent data Visualization |
title | Measuring Complexity in Lagrangian and Eulerian Flow Descriptions |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T07%3A22%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Measuring%20Complexity%20in%20Lagrangian%20and%20Eulerian%20Flow%20Descriptions&rft.jtitle=Computer%20graphics%20forum&rft.au=J%C3%A4nicke,%20H.&rft.date=2010-09&rft.volume=29&rft.issue=6&rft.spage=1783&rft.epage=1794&rft.pages=1783-1794&rft.issn=0167-7055&rft.eissn=1467-8659&rft_id=info:doi/10.1111/j.1467-8659.2010.01648.x&rft_dat=%3Cproquest_cross%3E1671438061%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c4118-43ac9253cafe89f71eee7eae5a2a684f83613cb8a5472d22b48225b580fcd9de3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=750565484&rft_id=info:pmid/&rfr_iscdi=true |