2006
DOI: 10.1109/tvcg.2006.104
|View full text |Cite
|
Sign up to set email alerts
|

Streamline Predicates

Abstract: Predicates are functions that return Boolean values. They are an essential tool in computer science. A close look at flow feature definitions reveals that they can be seen as point predicates that tell if a specific feature exists at a certain point. Besides the information about features, scientists and engineers like to know the overall behavior of all streamlines in the flow, typically in the connection with the important features in their application domain. We call this a structure definition for the flow… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 67 publications
(27 citation statements)
references
References 21 publications
0
26
0
Order By: Relevance
“…Salzbrunn and Scheuermann [26] propose combined Boolean predicates based on predefined scalar quantities, which determine for each streamline whether it has a desired property. Predicates on pathlines are applied to the visual analysis of measured blood flow in aortic aneurysms [27].…”
Section: User-guided Flow Partitioningmentioning
confidence: 99%
“…Salzbrunn and Scheuermann [26] propose combined Boolean predicates based on predefined scalar quantities, which determine for each streamline whether it has a desired property. Predicates on pathlines are applied to the visual analysis of measured blood flow in aortic aneurysms [27].…”
Section: User-guided Flow Partitioningmentioning
confidence: 99%
“…These time-consuming methods, largely-limited by the number of advection steps required, have been improved by the visualization community through GPU acceleration [11,25], adaptive mesh refinement techniques [10], and interpolation over sparse particles [2]. Others have used the Lagrangian methods by incorporating flow maps into the Eulerian representation of a flow field [28,26,17].…”
Section: Related Workmentioning
confidence: 99%
“…In addition to visualization, particle traces can be further analyzed to understand flow fields. The user can query for particle traces of interest by sketching [30] or explicit mathematical expressions [27] [28], or statistics from pathlines can be used to detect flow features [18][24] [29]. For these applications, it is desirable to densely place seeds in the domain in order to capture salient flow structures, thus requiring an efficient algorithm to advect a large number of particles.…”
Section: A Particle Advectionmentioning
confidence: 99%