kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Stream Line-Based Pattern Search in Flows
KTH, School of Computer Science and Communication (CSC), Computational Science and Technology (CST). Max Planck Institute for Informatics, Germany .ORCID iD: 0000-0002-1498-9062
2016 (English)In: Computer graphics forum (Print), ISSN 0167-7055, E-ISSN 1467-8659Article in journal (Refereed) Published
Abstract [en]

We propose a method that allows users to define flow features in form of patterns represented as sparse sets of stream line segments. Our approach finds similar occurrences in the same or other time steps. Related approaches define patterns using dense, local stencils or support only single segments. Our patterns are defined sparsely and can have a significant extent, i.e., they are integration-based and not local. This allows for a greater flexibility in defining features of interest. Similarity is measured using intrinsic curve properties only, which enables invariance to location, orientation, and scale. Our method starts with splitting stream lines using globally consistent segmentation criteria. It strives to maintain the visually apparent features of the flow as a collection of stream line segments. Most importantly, it provides similar segmentations for similar flow structures. For user-defined patterns of curve segments, our algorithm finds similar ones that are invariant to similarity transformations. We showcase the utility of our method using different 2D and 3D flow fields.

Place, publisher, year, edition, pages
Blackwell Publishing, 2016.
Keywords [en]
Pattern search, Stream lines, Visualization
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-195394DOI: 10.1111/cgf.12990ISI: 000417496200001Scopus ID: 2-s2.0-84981313250OAI: oai:DiVA.org:kth-195394DiVA, id: diva2:1044494
Note

QC 20161103

Available from: 2016-11-03 Created: 2016-11-03 Last updated: 2024-03-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Weinkauf, Tino

Search in DiVA

By author/editor
Weinkauf, Tino
By organisation
Computational Science and Technology (CST)
In the same journal
Computer graphics forum (Print)
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 61 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf