Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Stencil Jumping
CHF 43.15
Auf Lager
SKU
N5F5M5Q59MG
1 Verfügbar 
Geliefert zwischen Mi., 28.01.2026 und Do., 29.01.2026
Details
High Quality Content by WIKIPEDIA articles! 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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131211836
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131211836
- Format Fachbuch
- Titel Stencil Jumping
- Herausgeber Betascript Publishing
- Anzahl Seiten 84
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
