摘要 |
A computer-implemented method for optimizing bounds checking in a structured lattice having a regular pattern of neighboring nodes, includes the steps of: visiting a node in the lattice in a determined order, including bounds checking the node and performing a neighborhood process on the node; when said node is an interior node, calculating a distance k to a specified node in the determined order; visiting the next k nodes in the determined order without performing bounds checking and performing a neighborhood process on each of the next k nodes; and at least one of displaying or storing a result of the neighborhood process for the node. |