• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Time line cell tracking for the approximation of lagrangian coherent structures with subgrid accuracy

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Kuhn, Alexander
    Engelke, Wito
    Rössl, Christian
    Hadwiger, Markus cc
    Theisel, Holger
    KAUST Department
    Visual Computing Center (VCC)
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Date
    2013-12-05
    Online Publication Date
    2013-12-05
    Print Publication Date
    2014-02
    Permanent link to this record
    http://hdl.handle.net/10754/563145
    
    Metadata
    Show full item record
    Abstract
    Lagrangian coherent structures (LCSs) have become a widespread and powerful method to describe dynamic motion patterns in time-dependent flow fields. The standard way to extract LCS is to compute height ridges in the finite-time Lyapunov exponent field. In this work, we present an alternative method to approximate Lagrangian features for 2D unsteady flow fields that achieve subgrid accuracy without additional particle sampling. We obtain this by a geometric reconstruction of the flow map using additional material constraints for the available samples. In comparison to the standard method, this allows for a more accurate global approximation of LCS on sparse grids and for long integration intervals. The proposed algorithm works directly on a set of given particle trajectories and without additional flow map derivatives. We demonstrate its application for a set of computational fluid dynamic examples, as well as trajectories acquired by Lagrangian methods, and discuss its benefits and limitations. © 2013 The Authors Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd.
    Citation
    Kuhn, A., Engelke, W., Rössl, C., Hadwiger, M., & Theisel, H. (2013). Time Line Cell Tracking for the Approximation of Lagrangian Coherent Structures with Subgrid Accuracy. Computer Graphics Forum, 33(1), 222–234. doi:10.1111/cgf.12269
    Sponsors
    This work was partially funded by the German Federal Ministry of Education and Research under grant number 01LK1213A.
    Publisher
    Wiley
    Journal
    Computer Graphics Forum
    DOI
    10.1111/cgf.12269
    ae974a485f413a2113503eed53cd6c53
    10.1111/cgf.12269
    Scopus Count
    Collections
    Articles; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.