As neutrons pass through a magnetic field, their spin precesses. We seek to simulate this precession within the neutron tracing package McStas. Presented here are the methods and implementation details used to get arbitrary magnetic field data values when only a finite number of points are known.
Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very little analysis is available for the properties of the paths generated and the computational resources required to… (More)
Walking strategies are a standard tool for point location in a triangulation of size n. Although often claimed to be Θ(√ n) under random distribution hypotheses, this conjecture has only been formally proved by Devroye, Lemaire, and Moreau [Comp Geom–Theor Appl, vol. 29, 2004], in the case of the so called straight walk which has the very specific property… (More)