This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n5http://www.aiaa.org/
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n22http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n24https://web.archive.org/web/20041027115529/http:/www.iihr.uiowa.edu/~cfdship/documents/
n12https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n8http://www.iihr.uiowa.edu/~cfdship/documents/
n16http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
n18http://www.cfd-online.com/Wiki/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Stencil_jumping
rdf:type
yago:Activity100407535 yago:Abstraction100002137 yago:Rule105846932 yago:Act100030358 dbo:Software yago:Procedure101023820 yago:YagoPermanentlyLocatedEntity yago:Event100029378 yago:WikicatGeometricAlgorithms yago:PsychologicalFeature100023100 yago:Algorithm105847438
rdfs:label
Stencil jumping
rdfs:comment
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.
foaf:depiction
n16:Stencil_quad.png n16:Stencil_quad1.jpg
dcterms:subject
dbc:Geometric_algorithms
dbo:wikiPageID
11396089
dbo:wikiPageRevisionID
1021139577
dbo:wikiPageWikiLink
dbc:Geometric_algorithms dbr:Cross_product dbr:Algorithm dbr:Computational_Fluid_Dynamics dbr:Binary_search_algorithm dbr:Unstructured_grid dbr:Five-point_stencil n22:Stencil_quad.png n22:Stencil_quad1.jpg
dbo:wikiPageExternalLink
n5:content.cfm%3Fpageid=406&gTable=mtgpaper&gID=68623 n8:MarineCFD.PDF n18:Overset_grids n24:MarineCFD.PDF
owl:sameAs
freebase:m.02rb364 n12:4vn1r yago-res:Stencil_jumping wikidata:Q7607502
dbp:wikiPageUsesTemplate
dbt:Morefootnotes dbt:Cite_conference dbt:Cite_journal
dbo:thumbnail
n16:Stencil_quad.png?width=300
dbo:abstract
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.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Stencil_jumping?oldid=1021139577&ns=0
dbo:wikiPageLength
3997
foaf:isPrimaryTopicOf
wikipedia-en:Stencil_jumping