tes an nxn matrix (0 to 4),(0 to 4), OR 5X5
The loop only goes to (i-1),(j-1), (3,3)
i+1,j+1 = 4 which is within the range of IntPts.
Even so, why would one code work and not the other though? Although the initial code is slightly modified, it sends the same information to the second part which is identical code. Am I still missing something?
…
terrain seems to go upwards, providing extra attenuation. It would be good if we kenw if Pachyderm does compute the ISO 9613 attenuation for terrrain reflections / attenuation due to barriers.…
ini ball pivots could connect your initial "equal" wooden beams (instead of the Captain Hook "live-and-let-them-die" option, he he) ... but the problem is ... that require some bulletproof fixing policy (risky on smallish wood beans without a custom bracket: better safe than sorry).…
raft the first (4) 0's into a branch, then the next (5) 26's, then (5) 52's, then (8) 72's, and so on. The list is being generated does not have a consistent pattern of consecutive numbers, but if I could count the number of consecutive items, then I would be able to tell the list where to partition.…