Talk:Bilinear interpolation: Difference between revisions
m
→J Implementation? (and more "what is the task here?")
(→J Implementation? (and more "what is the task here?"): new section) |
|||
Line 9:
But some parts of it mystify me. For example, there is the commented out implementation of <code>combinations</code> which seems to be another alternative for the [[Combinations#J|Combinations]] task. But the only use of that routine is to compute <code>2 comb 3 [ require'stats'</code> and even that is commented out. Why is that there?
Also, there's the structures <code>CORNERS</code>, <code>N2</code> and <code>N3</code>. <code>CORNERS</code> is <code>_1+2*#:i.4</code> and <code>CORNERS</code> is also a prefix of <code>N2</code>. But the prefix of <code>N3</code> is <code>(|."1)_1+2*#:i.8</code> and that <code>(|."1)</code> part seems arbitrary, so I'm wondering how much of the rest of these constants is arbitrary. The use of A. already hints at something a bit arbitrary, and I guess I'd like to understand that better.
And, finally, the page suggests this be used for image processing, which in turn suggests something like the approach used in the [[Image_convolution#J|Image convolution]] task. (And, also, that only the 2 dimensional cases are relevant as anything other than exposition.) But that mostly just reminds me that [[User:Dkf|Donal Fellows]]'s question (above) remains unanswered. And, I guess I don't really understand what this task is about yet.
| |||