1 Abtract We consider radix sorting problems on two-dimensional mesh and three-dimensional mesh. By employing the radix sorting, we removed the necessity of comparator. Compared with previous sorting algorithms on the meshes which perform sorting based on comparison, our algorithm can be implemented on a simpler mesh since each processing element does not include the logic circuit for compariso...

A new technique which allows the simulation of thin ferrite absorbing tiles in a coarse TLM mesh is described. Results are presented which show a good fit to manufacturers' reflectivity curves. Experimental and simulation results for a screened room partially lined with ferrite are presented to demonstrate the accuracy of the method. INTRODUCTION The Transmission Line Matrix (TLM) method of num...

In numerical simulation where the underlying function is strongly directional, it is desirable to use a mesh that is adaptive both in size and in shape. In such simulation, a metric tensor is used to quantify the ideal size and direction locally at each point in the domain, which in turn deenes the local stretching and size of the triangles or quadrilater-als of the mesh. Given a metric tensor,...

The motion planning problem for an object with two degrees of freedom moving in the plane can be stated as follows: Given a set of polygonal obstacles in the plane, and a two-dimensional mobile object B with two degrees of freedom, determine if it is possible to move B from a start position to a nal position while avoiding the obstacles. If so, plan a path for such a motion. Techniques from com...

To address the issue of minimum mesh size regulations stow net fishery for croaker species, we tested and compared selectivity exploitation pattern diamond- square-mesh codends with sizes 35, 45 55 mm little yellow (Larimichthys polyactis), silver (Pennahia argentata), flower (Nibea albiflora) in Yellow Sea, China. Our results showed that legal codend (35 diamond-mesh) was inadequate to protect...

Most modern meshing algorithms produce asymptotically optimal size output. However, the size of the optimal mesh may not be bounded by any function of n. In this paper, we introduce well-paced point sets and prove that these will produce linear size outputs when meshed with any “size-optimal” meshing algorithm. This work generalizes all previous work on the linear cost of balancing quadtrees. W...

It is shown that cubic spline interpolation with the not-a-knot side condition converges to any C-interpoland without any mesh-ratio restriction as the mesh size goes to zero. AMS (MOS) Subject Classifications: 41A15, 41A05

The Courant-Friedrichs-Lewy (CFL) condition guarantees the stability of the popular explicit leapfrog method for the wave equation. However, it limits the choice of the time step size to be bounded by the minimal mesh size in the spatial finite element mesh. This essentially prohibits any sort of adaptive mesh refinement that would be required to reveal optimal convergence rates on domains with...