Python performance: iteration and operations on nested lists
- by J.J.
Problem Hey folks. I'm looking for some advice on python performance. Some background on my problem:
Given:
A mesh of nodes of size (x,y) each with a value (0...255) starting at 0
A list of N input coordinates each at a specified location within the range (0...x, 0...y)
Increment the value of the node at the input coordinate and the node's…