English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Pattern Search in Flows based on Similarity of Stream Line Segments

MPS-Authors
/persons/resource/persons45705

Wang,  Zhongjie
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons101866

Martinez Esturo,  Janick
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45449

Seidel,  Hans-Peter       
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons123492

Weinkauf,  Tino
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource

Link
(Any fulltext)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Wang, Z., Martinez Esturo, J., Seidel, H.-P., & Weinkauf, T. (2014). Pattern Search in Flows based on Similarity of Stream Line Segments. In J. Bender, & A. Kuijper (Eds.), VMV 2014 Vision, Modeling and Visualization (pp. 23-30). Goslar: Eurographics Association. doi:10.2312/vmv.20141272.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-5337-3
Abstract
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.