Streamline predicates.
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. A successful example for a structure definition is flow topology. In this paper, we present streamline predicates as functions that tell the user about the connection between streamlines and features selected by the user. This means answers to questions like: Which streamlines flow through a given vortex, separation bubble, or shock wave? It can be shown that streamline predicates may refine flow topology so that it also reveals questions about vortices in 3D.
Salzbrunn
Tobias
T
Universität Leipzig, Institut für Informatik, Germany. salzbrunn@informatik.uni-leipzig.de
Scheuermann
Gerik
G
D000465:Algorithms; D003196:Computer Graphics; D003198:Computer Simulation; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D008962:Models, Theoretical; D010363:Pattern Recognition, Automated / Q000379:methods*; D012212:Rheology / Q000379:methods*