Abstract :
A procedure is given for the construction of a von Neumann neighborhood iterative array to simulate a Moore neighborhood array in real time for the cases of up to three-dimensional arrays. The increase in the typical machine complexity accompanying this neighborhood complexity reduction is significantly less than that found in the general n-dimensional study of Cole [1].
Keywords :
Array machine complexity, iterative array, real time, stencil reduction.; Councils; Nearest neighbor searches; Array machine complexity, iterative array, real time, stencil reduction.;
