Efficient second order remapping on arbitrary two dimensional meshes

The authors have developed an efficient method of remapping physical variables from one unstructured grid composed of arbitrary polygons to another, based on the work of Ramshaw and Dukowicz. Eulerian cycles are used to convert the mesh into a single chain of connected edge,s which eliminates grid searching. The error is second order in the zone size. The algorithm handles degenerate meshes well. Computational effort to perform a remap scales linearly with the number of zones in the two grids, which is an improvement over typical N log N methods