Efficient function to accumulate a list of {value,coord} into array
- To: mathgroup at smc.vnet.net
- Subject: [mg132505] Efficient function to accumulate a list of {value,coord} into array
- From: julian.w.francis at gmail.com
- Date: Thu, 3 Apr 2014 02:17:21 -0400 (EDT)
- Delivered-to: l-mathgroup@mail-archive0.wolfram.com
- Delivered-to: l-mathgroup@wolfram.com
- Delivered-to: mathgroup-outx@smc.vnet.net
- Delivered-to: mathgroup-newsendx@smc.vnet.net
Dear all,
I am struggling with how to convert a list of (value, coords) tuples into an array such that the an element in the array should represent the sum of all value elements in that list with matching coords, and zero if no matches, e.g.
{ {3.6, 7,4}, {3,4, 8,6}, {2.1, 7,4} }
if it were a 10X10 element array would become all zero's, except element (7,4)->(3.6+2.1) and (8,6)->3.4
I've got some code which does what I want:
ParticleToDensity[particles_] := (
arr = ConstantArray[0, {144, 300}];
For[l = 1, l < NoParticles, l++,
(tp = particles[[l]];
If[tp[[2]] != 0,
arr[[Round[tp[[3]]], Round[tp[[2]]]]] += tp[[1]]]
)];
arr)
So, the argument to the function is a list of "particles", and the first element of this particle is the value in the array I'd like to accumulate, and the next two elements in that particle say where in the array they should be accumulated.
It seems to work, but it is slow. I can see that this isn't really the Mathematica way of doing things, but I'm struggling to think of a better way.
For reference, NoParticles is typically set to something like 10,000, and it takes about 0.1 secs to process on my machine. However this needs to be done frequently, hence I am hoping for a better way.
Any help greatly appreciated.
Thanks,
Julian.
- Follow-Ups:
- Re: Efficient function to accumulate a list of
- From: Bob Hanlon <hanlonr357@gmail.com>
- Re: Efficient function to accumulate a list of