Stencil jumping

From Wikipedia, the free encyclopedia

 This article may require cleanup to meet Wikipedia's quality standards.
Please improve this article if you can. (June 2007)

Stencil jumping, at times called stencil walking, is an algorithm 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 (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 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.

[edit] The principle

Consider one grid element of a 2 dimensional mesh as shown, for simplicity and consider a point O inside. The grid element vertices 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 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, all the cross products are not positive.This is the major testing criterion in the alogrithm.

[edit] 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 autoamtically located by getting the subsequent points. The required cross products are then found in the order

1) OA X AB

2) OB X BC

3) OC X CD

4) OD X DA

Each of these cross products are checked one by one(in the order shown) on who becomes negative first.if OA X AB becomes negative first, the next guess should be one step ahead along DA.if OB X 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.

[edit] References