Proceedings Visualization '95
DOI: 10.1109/visual.1995.485145
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of time-dependent particle tracing using tetrahedral decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
15
0

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(15 citation statements)
references
References 11 publications
0
15
0
Order By: Relevance
“…The point-locating scheme that is developed in this research is based on the tetrahedral walk method as described by Löhner et al (12), Kenwright et al (11) and Sadarjoen et al (13). This method uses the tetrahedral decomposition method that decomposes the different generic elements used in CFD grids (tetrahedra, pyramids, prisms and hexahedra) into tetrahedra.…”
Section: Point-locating Schemementioning
confidence: 99%
See 1 more Smart Citation
“…The point-locating scheme that is developed in this research is based on the tetrahedral walk method as described by Löhner et al (12), Kenwright et al (11) and Sadarjoen et al (13). This method uses the tetrahedral decomposition method that decomposes the different generic elements used in CFD grids (tetrahedra, pyramids, prisms and hexahedra) into tetrahedra.…”
Section: Point-locating Schemementioning
confidence: 99%
“…For example, in Fig.1, a particle's path intersecting a tetrahedron is shown. The particle is located outside the tetrahedron 1 The article of Kenwright et al (11) seems to contain a misprint in the calculation of and in this case two of the conditions given above are violated (η 1 < 0 and η 2 < 0). This means that the particle is located behind face ACD and to the left of face ABD.…”
Section: Point-locating Schemementioning
confidence: 99%
“…For unsteady (time-varying) flow integration, the vector field is determined at arbitrary temporal points by linearly interpolating the field between its spatially interpolated values at the nearest available time values. An adaptive integration algorithm (similar to the algorithm used by Kenwright and Lane [29]) is utilized to enable the integration to proceed rapidly in regions where the vector field is nearly constant, but to achieve high accuracy when the vector field rapidly changes direction from one cell to the next. The integration is performed by successively selecting points along a curve determined by field magnitude and direction at the most recent sample point.…”
Section: Vector Field Visualization In Vapormentioning
confidence: 99%
“…However, PSP may incur inaccuracies related to gather-scatter operations (i.e., interpolation to and from the grid), such as spurious compressibility effects and violation of charge and current density conservation [16,18,17]. Furthermore, PSP typically requires expensive particle location-tracking techniques [23,21] to "relocate" particles in logical cells after each particle push in physical space (although algorithms have been proposed that significantly speed up the particle localization step using a tetrahedral decomposition of hexahedral cells [24]). Logical-space-pushing (LSP) [7,20,25] avoids location-tracking and gather-scatter errors, but may incur in particle orbit errors due to discrete map information and the need to account for fictitious inertial forces [25] due to changes in geometry.…”
Section: Introductionmentioning
confidence: 99%