Stencil jumping, at times called stencil walking, is an
algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specificat ...
to locate the grid element enclosing a given point for any structured mesh. In simple words, given a point and a
structured mesh, this algorithm will help locate the grid element that will enclose the given point.
This algorithm finds extensive use in
Computational Fluid Dynamics
Computational fluid dynamics (CFD) is a branch of fluid mechanics that uses numerical analysis and data structures to analyze and solve problems that involve fluid flows. Computers are used to perform the calculations required to simulate th ...
(CFD) in terms of holecutting and interpolation when two meshes lie one inside the other. The other variations of the problem would be something like this: Given a place, at which latitude and longitude does it lie? The brute force algorithm would find the distance of the point from every mesh point and see which is smallest. Another approach would be to use a
binary search algorithm
In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the m ...
which would yield a result comparable in speed to the stencil jumping algorithm. A combination of both the binary search and the stencil jumping algorithm will yield an optimum result in the minimum possible time.
The principle
Consider one grid element of a 2-dimensional mesh as shown, for simplicity and consider a point O inside.
The vertices of the grid element are denoted by A, B, C and D and the vectors AB, BC, CD, DA, OA, OB, OC and OD are represented.
The
cross product
In mathematics, the cross product or vector product (occasionally directed area product, to emphasize its geometric significance) is a binary operation on two vectors in a three-dimensional oriented Euclidean vector space (named here E), and is ...
of OA and AB will yield a vector perpendicular to the plane coming out of the screen. We say that the magnitude of the cross product is positive. It will be observed that the cross products of OB and BC, OC and CD; and OD and DA are all positive.
This is not the case when the point is outside.
Here we see that not all the cross products are positive. This is the major testing criterion in the algorithm.
How does it move forward?
The algorithm needs a guess grid element to start off. The grid element can be found by the location of one point say A. The other points can be automatically located by getting the subsequent points. The required cross products are then found in the order
# OA × AB
# OB × BC
# OC × CD
# OD × DA
Each of these cross products are checked one by one (in the order shown) on which becomes negative first. If OA × AB becomes negative first, the next guess should be one step ahead along DA. If OB × BC is negative first, move along AB by one step to find the next guess and so on.
The algorithm will converge at the exact grid element where all the cross products are positive.
See also
*
Five-point stencil
In numerical analysis, given a square grid in one or two dimensions, the five-point stencil of a point in the grid is a stencil made up of the point itself together with its four "neighbors". It is used to write finite difference approximations to ...
References
*
*
*{{cite journal , doi=10.1016/S0376-0421(99)00013-5 , bibcode=2000PrAeS..36..117P , title=Parallel computing of overset grids for aerodynamic problems with moving objects , journal=Progress in Aerospace Sciences , volume=36 , issue=2 , pages=117 , year=2000 , last1=Prewitt , first1=Nathan C , last2=Belk , first2=Davy M , last3=Shyy , first3=Wei
External links
pegasus software
Geometric algorithms